Efficient geocasting with perfect delivery in wireless networks

@article{Seada2004EfficientGW,
  title={Efficient geocasting with perfect delivery in wireless networks},
  author={Karim Seada and Ahmed G. Helmy},
  journal={2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733)},
  year={2004},
  volume={4},
  pages={2551-2556 Vol.4}
}
  • K. Seada, A. Helmy
  • Published 21 March 2004
  • Computer Science
  • 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733)
Geocasting is the delivery of packets to nodes within a certain geographic area. For many applications in wireless networks, geocasting is an important and frequent communication service. The challenging problem in geocasting is distributing the packets to all the nodes within the geocast region with high probability but with low overhead. According to our study we notice a clear tradeoff between the proportion of nodes in the geocast region that receive the packet and the overhead incurred by… 

Figures from this paper

Geocasting in Wireless Ad Hoc Networks with Guaranteed Delivery
TLDR
This paper proposes a geocast routing protocol that guarantees the delivery of geocasts packets to all nodes inside a geOCast region and makes use of the nodes outside the geocAST region.
Efficient geocasting with multi-target regions in mobile multi-hop wireless networks
TLDR
This work proposes a basic scheme and its variations which utilize the geometric concept of “Fermat point” to determine the optimal junction point among multiple geocast regions from the source node and shows that the proposed schemes can effectively reduce the overhead of message delivery while maintaining a high delivery ratio in mobile multi-hop wireless networks.
Efficient geocasting to multiple regions in large-scale wireless sensor networks
  • C. Truong, K. Römer
  • Computer Science
    37th Annual IEEE Conference on Local Computer Networks
  • 2012
TLDR
Recursive Multi-region Geocasting (RMG) is presented, a novel multi-region geocast routing protocol which addresses the problem of delivering data from a source to multiple remote geocasts regions in large-scale wireless sensor networks.
Randomized multi-stage clustering-based geocast algorithms in anonymous wireless sensor networks
Geocasting or Multi-Geocasting in wireless sensor network is the delivery of packets from a source (or sink) to all the nodes located in one or several geographic areas. The objectives of a
Reliable dual-path geocasting for tactical ad hoc networks
TLDR
This paper proposes more reliable geocasting protocol which utilizes dual paths to improve the possibility of the successful message delivery and provides two different acknowledge mechanisms, by which a source node can be confirmed of the destined nodes' message reception.
Geometry-driven Scheme for Geocast Routing in Mobile Ad Hoc Networks
TLDR
In this scheme, the geometric concept of "Fermat point" is utilized to determine the optimal junction point among multiple geocast regions from the source node, and hence to reduce the overhead of message delivery, while maintaining a high delivery ratio.
ISOLATEDNODEFOR GEOCAST ROUTING IN VANET
TLDR
A probabilisticanalytical model based on neighbour node and isolated node on the highway is proposed and the numerical results show how connectivity between nodes depends on the transmission range, network density and total network area.
Performance analysis of geography-limited broadcasting in multihop wireless networks
TLDR
This paper considers achieving geography-limited broadcasting by means of the time-to-live (TTL) forwarding, which limits the propagation of a packet within a specified number of hops from the source, and shows that the TTL-based approach provides a practical trade-off between geographic coverage and broadcast overhead.
Virtual Surrounding Face Geocasting in Wireless Ad Hoc and Sensor Networks
TLDR
This study proposes the concept of Virtual Surrounding Face (VSF), and design a VSF-based geocasting protocol (VSFG), and designs a SKIP method and a local dominating set (DS) based restricted flooding technique to further reduce the cost of VSFG.
IDENTIFICATION OF NODES 2 . 1 The Occupancy Problem or the “ Bins in Balls ”
Geocasting or Multi-Geocasting in wireless sensor network is the delivery of packets from a source (or sink) to all the nodes located in one or several geographic areas. The objectives of a
...
...

References

SHOWING 1-10 OF 15 REFERENCES
Anycasting-based protocol for geocast service in mobile ad hoc networks
Flooding-Based Geocasting Protocols for Mobile Ad Hoc Networks
TLDR
Three geocasting protocols for ad hoc networks are proposed, obtained as variations of a multicast flooding algorithm, and three algorithms attempt to utilize physical location information to decrease the overhead of geocast delivery.
On the effect of location inaccuracy on geographic face routing in wireless networks
TLDR
It is quite crucial to develop a detailed understanding of the behavior of geographic routing for various practical settings and to evaluate its performance and (more importantly) its correctness in those settings.
GPSR: greedy perimeter stateless routing for wireless networks
TLDR
Greedy Perimeter Stateless Routing is presented, a novel routing protocol for wireless datagram networks that uses the positions of routers and a packet's destination to make packet forwarding decisions and its scalability on densely deployed wireless networks is demonstrated.
Routing with guaranteed delivery in ad hoc wireless networks
TLDR
The first distributed algorithms for routing that do not require duplication of packets or memory at the nodes and yet guarantee that a packet is delivered to its destination are described.
The broadcast storm problem in a mobile ad hoc network
TLDR
This paper proposes several schemes to reduce redundant rebroadcasts and differentiate timing of rebroadcast to alleviate the broadcast storm problem, which is identified by showing how serious it is through analyses and simulations.
Compass routing on geometric networks
TLDR
A close look at maps of numerous cities around the world, show that the previous way to explore a new, and unknown city will in general yield walks that will be close to the optimal ones to travel from one location to another.
Routing and Addressing Problems in Large Metropolitan-Scale Internetworks. ISI Research Report.
TLDR
This report addressed problems of isolated local area networks and routing and host mobility by developing an algorithm that retains robustness and has desirable commercial characteristics.
Worst-Case optimal and average-case efficient geometric ad-hoc routing
TLDR
GOAFR is the first ad-hoc algorithm to be both asymptotically optimal and average-case efficient and study a dozen of routing algorithms and shows that GOAFR outperforms other prominent algorithms, such as GPSR or AFR.
The relative neighbourhood graph of a finite planar set
...
...