Random Walk Based Routing Protocol for Wireless Sensor Networks

Mabrouki, Issam; Lagrange, Xavier; Froc, Gwillerm

doi:10.4108/inter-perf.2007.2112

Cited by 45 publications

(38 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Random walk based solutions for use in wireless sensor networks have been proposed in [10,11]. In particular, authors of [10] present data gathering in structured wireless sensor networks, where the sensor locations form a regular grid or hex-grid structure.…”

Section: The Rw-agentmentioning

confidence: 99%

“…In particular, authors of [10] present data gathering in structured wireless sensor networks, where the sensor locations form a regular grid or hex-grid structure. They present analytical findings of the node occupation probability and the first-passage probability of nodes, and through those calculate the latency and energy associated with the system to report from N nodes with N random walks to a set of ffiffiffiffi N p sinks.…”

Section: The Rw-agentmentioning

confidence: 99%

“…As flooding is considered not to be an option for large-scale, wireless sensor networks (WSNs) due to strict energy limitations of individual sensor nodes, solutions based on variations of the random walk based information dissemination paradigm are viewed as reasonable choices for searching and/or routing in WSNs [9][10][11]. Furthermore, there has been a significant body of work in adopting random walks for search or information dissemination in large peer-to-peer (P2P) networks [12][13][14][15].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Random walk with jumps in large-scale random geometric graphs

Tzevelekas

Οικονόμου

Stavrakakis

2010

Computer Communications

View full text Add to dashboard Cite

a b s t r a c tThe information dissemination problem in large-scale networking environments like wireless sensor networks and ad hoc networks is studied here considering random geometric graphs and random walk based approaches. A new type of random walk based agent is proposed in this paper and an analytical expression with respect to coverage (i.e., the proportion of the network nodes visited by the random walk agent) as a function of the number of the agent movements is derived. It is observed that the cover time of many of already existing random walk based variants is large in random geometric graphs of low degree (as it is commonly the case is wireless environments). As this inefficiency is attributed (as discussed in the paper) to the inability of existing random walk based solutions to move away from already likely covered areas, a mechanism for directional movement (i.e., jumping) of the random walk based agent is proposed and studied, that allows the agent to jump to different network areas, most likely not covered yet. The proposed mechanism (Jumping Random Walk) is studied analytically and via simulations and the parameters (of the network topology and the mechanism) under which the proposed scheme outperforms existing random walk based variations are determined.

show abstract

Section: The Rw-agentmentioning

confidence: 99%

Section: The Rw-agentmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Random walk with jumps in large-scale random geometric graphs

Tzevelekas

Οικονόμου

Stavrakakis

2010

Computer Communications

View full text Add to dashboard Cite

show abstract

“…Zuniga et al [17] study non-revisiting random walks. The work of Mabrouki et al [42] provides an analytical model to evaluate the performance of a random walk-based routing protocol for wireless sensor networks with special attention to two metrics: the mean system data gathering delay and the induced spatial distribution of energy consumption.…”

Section: Related Workmentioning

confidence: 99%

Random Walker Coverage Analysis for Information Dissemination in Wireless Sensor Networks

2017

View full text Add to dashboard Cite

Abstract:The increasing technological progress in electronics provides network nodes with new and enhanced capabilities that allow the revisit of the traditional information dissemination (and collection) problem. The probabilistic nature of information dissemination using random walkers is exploited here to deal with challenges imposed by unconventional modern environments. In such systems, node operation is not deterministic (e.g., does not depend only on network nodes' battery), but it rather depends on the particulars of the ambient environment (e.g., in the case of energy harvesting: sunshine, wind). The mechanism of information dissemination using one random walker is studied and analyzed in this paper under a different and novel perspective. In particular, it takes into account the stochastic nature of random walks, enabling further understanding of network coverage. A novel and original analysis is presented, which reveals the evolution network coverage by a random walker with respect to time. The derived analytical results reveal certain additional interesting aspects regarding network coverage, thus shedding more light on the random walker mechanism. Further analytical results, regarding the walker's spatial movement and its associated neighborhood, are also confirmed through experimentation. Finally, simulation results considering random geometric graph topologies, which are suitable for modeling mobile environments, support and confirm the analytical findings.

show abstract

“…These approaches have focused on the use of random walks [5], [6] in which a route request starts at the source and travels along a single path found by consecutive random next-hop choices in search for the destination. The limitation of this prior work is that the communication complexity incurred in reaching destinations when packets have to traverse random walks may be comparable to that of flooding, but with much longer delays.…”

Section: Related Workmentioning

confidence: 99%

Using geographical coordinates to attain efficient route signaling in ad hoc networks

Wang

Westphal

Garcia-Luna-Aceves

2013

2013 IEEE 14th International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM)

View full text Add to dashboard Cite

Abstract-Flooding of route requests or link states is a necessity in many routing protocols for mobile ad hoc networks (MANET), and several mechanisms have been devised to make flooding more efficient; however, all flooding approaches to date are such that the number of neighbors each node must use to relay a flooded packet grows as the node density increases. A new method, called ORCA (On-demand Routing with Coordinates Awareness) is introduced for the dissemination of route requests in MANETs. The selection of relaying nodes at each node in ORCA is done by computing the shortest Euclidean Distance from all neighbors of the node to four polar points located in the transmission range of the node. We prove that ORCA guarantees the coverage of all nodes in a connected MANET, and that the number of relays for each node is at most six. ORCA is compared with representative routing protocols, namely AODV, OLSR, LAR, and THP. The simulation results in networks of 200 and 250 nodes show that ORCA incurs the smallest routing load while attaining average delays and packet delivery ratios that are comparable to or better than those obtained with the other four routing protocols.

show abstract

Random Walk Based Routing Protocol for Wireless Sensor Networks

Cited by 45 publications

References 14 publications

Random walk with jumps in large-scale random geometric graphs

Random walk with jumps in large-scale random geometric graphs

Random Walker Coverage Analysis for Information Dissemination in Wireless Sensor Networks

Using geographical coordinates to attain efficient route signaling in ad hoc networks

Contact Info

Product

Resources

About