Beacon assisted discovery protocol (BEAD) for self-organizing hierarchical ad-hoc networks

Raju, L Raghavendar; Ganu, Sachin; Anepu, B.; Seskar, Ivan; Raychaudhuri, Dipankar

doi:10.1109/glocom.2004.1378266

Cited by 17 publications

(8 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such systems use beacon messages to transmit information pertaining to neighbor discovery. One such technique is discussed in [19]. The beacon messages can be modified to include the node ID of the neighbor.…”

Section: Movement Of the Destination Nodementioning

confidence: 99%

An efficient and flexible MPLS signaling framework for mobile networks

Nagarajan

Ekici

2007

Wireless Netw

View full text Add to dashboard Cite

Multiprotocol Label Switching (MPLS) has gained momentum in recent years as an effective tool to provide Quality of Service (QoS) in a variety of networks. This has in turn created active interest in the area of recovery in MPLS based networks. A number of recovery schemes for MPLS domains have been proposed in recent years. However, the current schemes lack support for recovery in dynamic network topologies. In this paper, a new flexible signaling protocol for LSP rerouting in dynamic network environments is introduced. The signaling protocol recovers from node and link failures reactively, taking a local approach to LSP reestablishment. The performance of the signaling protocol is evaluated through simulations. Results indicate that the protocol can effectively and efficiently handle rerouting in dynamic networks with a low protocol signaling overhead as compared to contemporary MPLS rerouting protocols. This would enable the MPLS based IP-QoS support mechanisms to extend to dynamic network topologies.

show abstract

Section: Movement Of the Destination Nodementioning

confidence: 99%

An efficient and flexible MPLS signaling framework for mobile networks

Nagarajan

Ekici

2007

Wireless Netw

View full text Add to dashboard Cite

show abstract

“…• Little or No Theoretical Guarantees: Work in [48,60] only evaluate the proposed neighbor discovery algorithms using experiments; no attempt is made to provide any theoretical (deterministic or probabilistic) guarantees. Work in [6] provides a suite of neighbor discovery algorithms that can tolerate jamming attacks.…”

Section: Related Workmentioning

confidence: 99%

Robust neighbor discovery in multi-hop multi-channel heterogeneous wireless networks

Mills

Gokhale

Mittal

et al. 2016

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

An important first step when deploying a wireless ad hoc network is neighbor discovery in which every node attempts to determine the set of nodes it can communicate within one wireless hop. In the recent years, cognitive radio (CR) technology has gained attention as an attractive approach to alleviate spectrum congestion. A cognitive radio transceiver can operate over a wide range of frequencies possibly spanning multiple frequency bands. A cognitive radio node can opportunistically utilize unused wireless spectrum without interference from other wireless devices in its vicinity. Due to spatial variations in frequency usage and hardware variations in radio transceivers, different nodes in the network may perceive different subsets of frequencies available to them for communication. This heterogeneity in the available channel sets across the network increases the complexity of solving the neighbor discovery problem in a cognitive radio network. In this work, we design and analyze several randomized algorithms for neighbor * A preliminary version of the work has appeared earlier in the discovery in such a (heterogeneous) network under a variety of assumptions (e.g., maximum node degree known or unknown) for both synchronous and asynchronous systems under minimal knowledge. We also show that our randomized algorithms are naturally suited to tolerate unreliable channels and adversarial attacks. IntroductionNeighbor discovery is an important step in forming a self-organizing wireless ad hoc network without any support from an existing communication infrastructure [8,9,19,20,29,42,51,54,57,58,63]. When deployed, nodes initially have no prior knowledge of other nodes that they can communicate with directly.The results of neighbor discovery can be used to solve other important communication problems such as medium access control [7,22], routing [15], broadcasting [50,54], clustering [16,32,40], collision-free scheduling [26,27], spanning tree construction [21], and topology control [37,62].Many algorithms for solving these problems implicitly assume that all nodes know their one-hop and sometimes even two-hop neighbors. Many location-based routing protocols (e.g. localized routing in Vehicular Ad hoc Networks (VANETs)) use the position of neighboring nodes to make routing/forwarding decisions. The neighborhood information is also used to update the reachability status of nodes. A better neighbor discovery algorithm, which uses fewer messages and has higher accuracy, can be used to improve the performance of location-based routing algorithms [10][11][12].Neighborhood information helps reduce the cost of flooding in multicast tree construction using flooding algorithms [39]. Mobile sensing applications, ranging from mobile social networking to proximity-based gaming, involve collection and sharing of data among nearby users. The success of these applications depends on neighborhood information [20]. Neighbor discovery is extremely important in Underwater Acoustic (UWA) Networks and needs to be done frequently because nodes...

show abstract

“…[14]). In [15] the authors propose a beacon assisted discovery mechanism that operates between MAC and network layers. The proposed discovery protocol operates by listening to augmented MAC-Layer beacons from the neighboring radio nodes, and after that, the best of its associations is selected based on specific criteria.…”

Section: B Discovery and Routingmentioning

confidence: 99%

Self-adapted protocol for intra and inter-echelons communications

Gomes

Valadas

Zúquete

et al. 2014

2014 16th International Telecommunications Network Strategy and Planning Symposium (Networks)

View full text Add to dashboard Cite

Nowadays, both military and civil emergency scenarios demand shared-situation awareness between the front-line elements, in order to maximize the effectiveness of the operations. This requires a communication system based on mechanisms that self-adapt to dynamic conditions and that are able to work under heterogeneous networks. The proposed Cognitive Routable Adhoc Network (CRAN) protocol allows efficient and distributed information sharing within the same hierarchy and between distinct hierarchical levels. The CRAN mechanisms contain the control plane, which includes the discovery mechanism and the autonomous adaptation when topology changes, and the data plane, which is responsible to forward tactical messages within the platoon. The evaluation results show that CRAN provides a fast knowledge forwarding with high message delivery and requires small bandwidth. This ensures real-time situation updates, improving operational reality awareness and more accurate decisions, improving the overall operation results.

show abstract

Beacon assisted discovery protocol (BEAD) for self-organizing hierarchical ad-hoc networks

Cited by 17 publications

References 10 publications

An efficient and flexible MPLS signaling framework for mobile networks

An efficient and flexible MPLS signaling framework for mobile networks

Robust neighbor discovery in multi-hop multi-channel heterogeneous wireless networks

Self-adapted protocol for intra and inter-echelons communications

Contact Info

Product

Resources

About