Position-based multicast routing for mobile Ad-hoc networks

Mauve, Martin; Füßler, Holger; Widmer, Jörg; Lang, Thomas

doi:10.1145/961268.961288

Cited by 129 publications

(66 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the past few years, Mobile Ad Hoc Networks (MANETs) [12]- [14] have become an important topic. In the MANET, the middle of the node will release small control packets; these packets left messages on each node via node forwarding.…”

Section: B Geographic Routingmentioning

confidence: 99%

Applications for Improving Geographic Routing Paths in Wireless Sensor Networks

Chen¹,

Ding²,

Chang³

et al. 2014

JACN

View full text Add to dashboard Cite

Abstract-This paper proposes the Geographic Multicast Fermat Point (GMFP) architecture with an Inside Relay Node (IRN). We use Fermat Point architecture to find the relay Fermat Point node to reduce the distance between received nodes. We also use the Energy-Efficient Beaconless Geographic Routing (EBGR) method to effectively find the optimal relay node position and reduce energy consumption between source nodes and Fermat Points, so that packets are forwarded for all relay nodes. Simulation results show that total energy consumption of GMFP architecture with an IRN outperforms that of GMFP architecture, thereby extending the system lifetime.

show abstract

Section: B Geographic Routingmentioning

confidence: 99%

Applications for Improving Geographic Routing Paths in Wireless Sensor Networks

Chen¹,

Ding²,

Chang³

et al. 2014

JACN

View full text Add to dashboard Cite

show abstract

“…The high dynamics of MANET, however, makes the design of a scalable, robust and efficient multicast protocol much more challenging due to the difficulty in group membership management, multicast packet forwarding and the maintenance of a tree-or mesh-based multicast structure. Similar to unicast routing, lately some geographic multicast schemes have been proposed to increase the routing performance in MANET, in which the protocols presented in [1], [4] and [16] need to put the information of all the group members into the packet header and can hardly scale to large group. And the scheme in [24] is hard to scale to large network size due to its periodic local-range and network-range membership flooding.…”

Section: Geographic Routing In Manetmentioning

confidence: 99%

A Scalable Geographic Service Provision Framework for Mobile Ad Hoc Networks

Xiang

Wang

2007

Fifth Annual IEEE International Conference on Pervasive Computing and Communications (PerCom'07)

View full text Add to dashboard Cite

show abstract

“…For instance, algorithms such as LAR [1], GRID [2], and GOAFR+ [3] rely on the location information to provide more stable routes during unicast route discovery. The availability of location information is also required for geocast protocols such as LBM [4], GeoGRID [5], and PBM [6]. To minimize the power consumption, the GAF algorithm [7] uses location information to modify the network density by turning off certain nodes at particular instances.…”

Section: Introductionmentioning

confidence: 99%

Beacon Deployment for Sensor Network Localization

Huang

Záruba

2007

2007 IEEE Wireless Communications and Networking Conference

View full text Add to dashboard Cite

Abstract-Localization in sensor networks is the process of obtaining geographical location information for all deployed sensors. Localizing each sensor node is becoming increasingly important as more and more algorithms and protocols in the disciplines of routing, energy management, and security have been proposed that rely on (semi-) accurate location information. In this paper, we study a particular approach to sensor node localization that uses sequentially deployed beacons to localize sensors. Our model assumes that the localization information can be obtained by observing beacons 1-hop away from the sensors. We show that under this simplified model the beacon deployment problem, i.e., to find the minimum number of beacons, is (still) NP-Complete. We then provide an approximation algorithm with a logarithmic approximation ratio based on a set cover greedy heuristic; we study both offline and online versions of this approximation. Finally, we incorporate the localization accuracy into the beacon deployment strategy by explicitly specifying the Cramer Rao Bound (CRB) as the condition. We verify the performance of the proposed algorithms using simulations, and show that accurate localization can be effectively achieved using the proposed algorithms.

show abstract

Position-based multicast routing for mobile Ad-hoc networks

Cited by 129 publications

References 3 publications

Applications for Improving Geographic Routing Paths in Wireless Sensor Networks

Applications for Improving Geographic Routing Paths in Wireless Sensor Networks

A Scalable Geographic Service Provision Framework for Mobile Ad Hoc Networks

Beacon Deployment for Sensor Network Localization

Contact Info

Product

Resources

About