Hazy Sighted Link State Routing Protocol

About: Hazy Sighted Link State Routing Protocol is a research topic. Over the lifetime, 6936 publications have been published within this topic receiving 169377 citations. The topic is also known as: HSLS.

Cooperative Routing in Multi-Source Multi-Destination Multi-Hop Wireless Networks

Abstract: In a network supporting cooperative communication, the sender of a transmission is no longer a single node, which causes the concept of a traditional link to be reinvestigated. Thus, the routing scheme basing on the link concept should also be reconsidered to ";truly"; exploit the potential performance gain introduced by cooperative communication. In this paper, we investigate the joint problem of routing selection in network layer and contention avoidance among multiple links in MAC layer for multi-hop wireless networks in a cooperative communication aware network. To the best of our knowledge, it is the first work to investigate the problem of cooperative communication aware routing in multi-source multi-destination multi-hop wireless networks. Several important concepts, including virtual node, virtual link and virtual link based contention graph are introduced. Basing on those concepts, an optimal cooperative routing is achieved and a distributed routing scheme is proposed after some practical approximations. The simulation results show that our scheme reduces the total transmission power comparing with non-cooperative routing and greatly increases the network throughput comparing with single flow cooperative routings.

EWANT: the emulated wireless ad hoc network testbed

Abstract: In this paper we demonstrate a wireless 802.11 testbed. This testbed allows for direct comparison between mobile wireless routing protocols without affecting their routing or MAC layer protocols or inter-layer interaction. We have built a low cost environment to facilitate such wireless network research. The core idea is "compressing" the network and emulating mobility without actually moving the nodes. We successfully emulate the RF effects along with mobility. The viability of this test bed is checked with the help of a click implementation of the dynamic source routing protocol. Our experiences show that such a testbed provides valuable feedback not available through simulation.

Distributed network management

Abstract: Hosts or end-systems residing at the edges of a network gather data about the traffic they transmit into and receive from the network. The network's routing protocol (typically a link-state protocol such as OSPF) is monitored and routing data or packets are used to recover the network's current status and topology. This data can be collected, fused, and maintained and a platform, preferably distributed, can be provided to query the data, thus enabling a variety of network management applications.

Distributed Energy-Efficient Cooperative Routing in Wireless Networks

Abstract: Recently, cooperative routing in wireless networks has gained much interest due to its ability to exploit the broadcast nature of the wireless medium in designing power-efficient routing algorithms. Most of the existing cooperation-based routing algorithms are implemented by finding a shortest-path route first. As such, these routing algorithms do not fully exploit the merits of cooperative communications at the physical layer. In this paper, we propose a cooperation-based routing algorithm, namely, minimum power cooperative routing (MPCR) algorithm, which makes full use of the cooperative communications while constructing the minimum-power route. The MPCR algorithm constructs the minimum-power route as a cascade of the minimum-power single-relay building blocks from the source to the destination. Hence, any distributed shortest-path algorithm can be utilized to find the optimal route with polynomial complexity, while guaranteeing certain throughput. We show that the MPCR algorithm can achieve power saving of 57.36% compared to the conventional shortest-path routing algorithms. Furthermore, the MPCR algorithm can achieve power saving of 37.64% compared to the existing cooperative routing algorithms, in which the selected routes are constructed based on the noncooperative routes.