DocumentCode :
2766058
Title :
Modeling ad hoc sensor networks using random graph theory
Author :
Kawahigashi, Haruko ; Terashima, Yoshiaki ; Miyauchi, Naoto ; Nakakawaji, Tetsuo
Author_Institution :
Inf. Technol. Lab., Mitsubishi Electr. Corp., Kamakura, Japan
fYear :
2005
fDate :
3-6 Jan. 2005
Firstpage :
104
Lastpage :
109
Abstract :
Modeling of ad hoc sensor networks becomes difficult when uncertain features of the network increase. Deterministic modeling is difficult and some stochastic arguments should be introduced instead. In this paper, we introduce the concept of random networks. One remarkable feature of random graphs is that a phase transition occurs as the probability of edge connection increases. At the critical probability, fragmented pieces of edges suddenly start to be mutually connected, forming one large component. This graph-theoretical change parallels phase transitions in states of mutter, e.g. the jump from water to ice. In ad hoc sensor networks, the nodes are connected by wireless links. In order to meet this requirement, we propose a model using percolation, a kind of random graph where the edges are formed only between the nearby nodes. We also present some numerical examples to simulate the jump effects of the phase transition.
Keywords :
ad hoc networks; graph theory; probability; radio links; stochastic processes; wireless sensor networks; ad hoc sensor network; percolation; probability of edge connection; random graph theory; wireless sensor network; Ad hoc networks; Graph theory; Ice; Information technology; Laboratories; Numerical simulation; Sensor phenomena and characterization; Stochastic processes; Tree graphs; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Consumer Communications and Networking Conference, 2005. CCNC. 2005 Second IEEE
Print_ISBN :
0-7803-8784-8
Type :
conf
DOI :
10.1109/CCNC.2005.1405152
Filename :
1405152
Link To Document :
بازگشت