By Topic

Modeling ad hoc sensor networks using random graph theory

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Kawahigashi, Haruko ; Inf. Technol. Lab., Mitsubishi Electr. Corp., Kamakura, Japan ; Terashima, Y. ; Miyauchi, N. ; Nakakawaji, T.

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.

Published in:

Consumer Communications and Networking Conference, 2005. CCNC. 2005 Second IEEE

Date of Conference:

3-6 Jan. 2005