Topic
Ad hoc wireless distribution service
About: Ad hoc wireless distribution service is a research topic. Over the lifetime, 17734 publications have been published within this topic receiving 488205 citations.
Papers published on a yearly basis
Papers
More filters
14 Nov 2000
TL;DR: This paper considers the problem of providing a geocast service in mobile ad hoc networks and presents a novel geocasting algorithm combining unicasting and flooding, derived from the TORA (unicast) routing protocol, and is named GeoTORA.
Abstract: This paper considers the problem of providing a geocast service in mobile ad hoc networks and presents a novel geocasting algorithm combining unicasting and flooding. Geocast is useful for sending messages to everyone in a specified geographical region. The proposed protocol is named GeoTORA, because it is derived from the TORA (unicast) routing protocol. Flooding is also incorporated in GeoTORA, but it is limited to nodes within a small region. This integration of TORA and flooding can significantly reduce the overhead of geocast delivery while maintaining reasonably high accuracy.
236 citations
Journal Article•
TL;DR: This paper presents and discusses some basic principles of routing and pays high attention to how these differ from conventional routing.
Abstract: AD HOC is characterized by simple organizing, low cost, strong survival ability, and adaptation to many applications and so on. The routing principles play an important role in the realization of the above target. This paper presents and discusses some basic principles of routing and pays high attention to how these differ from conventional routing.
232 citations
05 Oct 2004
TL;DR: This work presents a leader election algorithm that is highly adaptive to arbitrary (possibly concurrent) topological changes and is therefore well-suited for use in mobile ad hoc networks and shows that each node has a leader approximately 97-99% of the time in a variety of operating conditions.
Abstract: Leader election is a very important problem, not only in wired networks, but in mobile, ad hoc networks as well. Existing solutions to leader election do not handle frequent topology changes and dynamic nature of mobile networks. We present a leader election algorithm that is highly adaptive to arbitrary (possibly concurrent) topological changes and is therefore well-suited for use in mobile ad hoc networks. The algorithm is based on finding an extrema and uses diffusing computations for this purpose. We show, using linear-time temporal logic, that the algorithm is "weakly" self-stabilizing and terminating. We also simulate the algorithm in a mobile ad hoc setting. Through our simulation study, we elaborate on several important issues that can significantly impact performance of such a protocol for mobile ad hoc networks such as choice of signaling, broadcast nature of wireless medium etc. Our simulation study shows that our algorithm is quite effective in that each node has a leader approximately 97-99% of the time in a variety of operating conditions.
232 citations
Book•
10 Nov 2008
TL;DR: This is one of the firstpublications to focus on wireless ad hoc and sensor networks with a concentration on algorithms and protocols providing you with a comprehensive resource to learn about the continuous advances in wireless and mobile communications.
Abstract: Boukerche is well-known and established international researcher in the field of wireless mobile networks and distributed systems. This is one of the firstpublications to focus on wireless ad hoc and sensor networks with a concentration on algorithms and protocols providing you with a comprehensive resource to learn about the continuous advances in wireless and mobile communications.
232 citations