Virtual Surrounding Face Geocasting with Guaranteed Message Delivery for Ad Hoc and Sensor Networks

Lian, Jie; Naik, Kshirasagar; Chen, Lei

doi:10.1109/icnp.2006.320213

Cited by 18 publications

(13 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The protocol then creates a shared path for different destinations. Both protocols [7,8] guarantee delivery of the packets only in a dense network and do not guarantee delivery in a sparse network.…”

Section: Related Workmentioning

confidence: 99%

“…The main difference between the algorithm [5] and the one proposed in [6] is that external border nodes in [6] also perform the right-hand based-face traversals with respect to all corresponding neighbors internal border nodes. The authors in [7] proposed Virtual Surrounding Face (VSF). In VSF, the geoacast region is constructed by ignoring the edges intersecting the geocast region in a planar graph.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

An Energy-Efficient Clique-Based Geocast Algorithm for Dense Sensor Networks

Bomgni¹,

Myoupo²

2010

View full text Add to dashboard Cite

This paper proposes an energy-efficient geocast algorithm for wireless sensor networks with guaranteed delivery of packets from the sink to all nodes located in several geocast regions. Our approach is different from those existing in the literature. We first propose a hybrid clustering scheme: in the first phase we partition the network in cliques using an existing energy-efficient clustering protocol. Next the set of clusterheads of cliques are in their turn partitioned using an energy-efficient hierarchical clustering. Our approach to consume less energy falls into the category of energy-efficient clustering algorithm in which the clusterhead is located in the central area of the cluster. Since each cluster is a clique, each sensor is at one hop to the cluster head. This contributes to use less energy for transmission to and from the clusterhead, comparatively to multi hop clustering. Moreover we use the strategy of asleep-awake to minimize energy consumption during extra clique broadcasts.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

An Energy-Efficient Clique-Based Geocast Algorithm for Dense Sensor Networks

Bomgni¹,

Myoupo²

2010

View full text Add to dashboard Cite

show abstract

“…To overcome this issue, GFPG [11], VSF [12], and [13] propose to include out-region nodes in packet dissemination. GFPG uses face routing on the planar faces intersecting the region border in addition to flooding inside the region to reach all nodes.…”

Section: B Geocasting To a Single Regionmentioning

confidence: 99%

“…Many single-/multi-region geocasting protocols such as in [8], [11], [14], either treat the shape of the geocast regions as a convex closed polygon (square, rectangle, circle), or as in [12], as a concave closed polygon shape. The authors implicitly assume that a closed polygon is described by a set of points and some extra information, e.g., a circle is given by its center and radius, which are included in the packet header.…”

Section: B Shape Of Geocast Regionsmentioning

confidence: 99%

Efficient geocasting to multiple regions in large-scale wireless sensor networks

Truong

Römer

2012

37th Annual IEEE Conference on Local Computer Networks

View full text Add to dashboard Cite

Abstract-Recently, large sensor networks with several thousands of nodes are being deployed over large geographic areas in the context of smart city projects. In these settings, there is often a need to send a message to all sensors contained in one of multiple geographic regions, for example, to query for a free parking spot in several streets. We present Recursive Multiregion Geocasting (RMG), a novel multi-region geocast routing protocol which addresses the problem of delivering data from a source to multiple remote geocast regions in large-scale wireless sensor networks. The key idea is to treat a remote group of geocast regions as a point destination and forward data packets along a straight line towards the group, until a division point at which the group is divided, and the packet is forwarded towards the sub-groups in the same fashion. RMG is lightweight as no state has to be maintained at the nodes and the computations are simple. Simulation shows that our protocol achieves lower path length overhead and network relay load while incurring less computation overhead when compared to state-of-the-art protocols.

show abstract

“…Many of these solutions (e.g., [4], [5]) are based on graph theory, which relies on the unrealistic Unit Disk Graph (UDG) model; also, the impact of imperfect link layer is not considered. As a result, these solutions do not perform well in UW-ASNs.…”

Section: Introductionmentioning

confidence: 99%

Reliable geocasting solution for underwater acoustic sensor networks

Chen

Pompili

2011

2011 - MILCOM 2011 Military Communications Conference

View full text Add to dashboard Cite

Abstract-Reliable data delivery for underwater acoustic sensor networks is a major concern in applications such as surveillance, data collection, navigation, and ocean monitoring. Geocastingwhich is the transmission of data packet(s) to nodes located in a certain geographic region -is becoming a crucial communication primitive. In this work, two versions of a distributed, reliable, and efficient underwater geocasting protocol, which are based on different degrees of neighbor information, are proposed for underwater networks whose acoustic modems use random-access Medium Access Control (MAC) protocols. By jointly considering the position uncertainty of nodes, MAC, and routing functionalities, packet transmissions are prioritized and scheduled in order to maximize link reliability while limiting end-to-end geocasting delay. Moreover, a mechanism is designed to save the number of transmissions by selecting only a subset of neighbors for packet forwarding. Performance of the proposed protocol is evaluated and compared via simulations against existing geocasting solutions tailored for terrestrial wireless networks.

show abstract

Virtual Surrounding Face Geocasting with Guaranteed Message Delivery for Ad Hoc and Sensor Networks

Abstract: Abstract

Cited by 18 publications

References 18 publications

An Energy-Efficient Clique-Based Geocast Algorithm for Dense Sensor Networks

An Energy-Efficient Clique-Based Geocast Algorithm for Dense Sensor Networks

Efficient geocasting to multiple regions in large-scale wireless sensor networks

Reliable geocasting solution for underwater acoustic sensor networks

Contact Info

Product

Resources

About