Topology control in ad hoc wireless networks with hitch-hiking

Cardei, Mihaela; Wu, Jie; Yang, Shuhui

doi:10.1109/sahcn.2004.1381950

Cited by 15 publications

(12 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In recent years, many researchers have focused on the optimization of energy consumption of mobile nodes, from different points of view. Some of the proposed solutions try to adjust the transmission power of wireless nodes (Cardei et al, 2004;Ingelrest et al, 2006). Other proposals tend to efficiently manage a sleep state for the nodes: these solutions range from pure MAC-layer solutions (as the power management of 802.11) to solutions combining MAC and routing functionality (Xu et al, 2001).…”

Section: Energy Saving Techniques At Routing Layermentioning

confidence: 99%

Energy Issues and Energy Aware Routing in Wireless Ad Hoc Networks

Fotino¹,

Rango²

2011

Mobile Ad-Hoc Networks: Protocol Design

View full text Add to dashboard Cite

Section: Energy Saving Techniques At Routing Layermentioning

confidence: 99%

Energy Issues and Energy Aware Routing in Wireless Ad Hoc Networks

Fotino¹,

Rango²

2011

Mobile Ad-Hoc Networks: Protocol Design

View full text Add to dashboard Cite

“…In [7], the paper presents an algorithm to obtain a strongly connected topology by adjusting the transmission power of every node in the network. Because this solution is NP-hard, authors have proposed a distributed solution that used the Hitch-Hiking mechanism.…”

Section: Power Controlmentioning

confidence: 99%

“…In a global point of view, these researches: -Switch nodes' energy level between sleep and awake states [5,8,15,16,18,21,22]. -By keeping nodes in the active state, perform power control [2,7,13] or energy-aware routing [1,3,4,11,12,14].…”

Section: Introductionmentioning

confidence: 99%

Looking for network functionalities’ extension by avoiding energy-compromised hotspots in wireless sensor networks

2008

View full text Add to dashboard Cite

The vast literature on the wireless sensor research community contains many valuable proposals for managing energy consumption, the most important factor that determines sensors' lifetime. Interesting researches have been facing this requirement by focusing on the extension of the entire network lifetime: either by switching between node states (active, sleep) or by using energy-efficient routing. We argue that a better extension of the network lifetime can be obtained if an efficient combination of management mechanisms can be performed at the energy of each single sensor and at the load distribution over the network. Considering these two accuracy levels (i.e., node and network), this paper presents a new approach that uses cost functions to choose energy-efficient routes. In particular, by making different energy considerations at a node level, our approach distributes routing load, avoiding, thus, energy-compromised hotspots that may cause network disconnections. The proposed cost functions have completely decentralized and adaptive behavior and take into consideration the end-to-end energy consumption, the remaining energy of nodes, and the number of transmissions a node can make before its energy depletion. Our simulation results show that, though slightly This research was financed by the ANR-OCARI project.

show abstract

“…In [3] the paper presents an algorithm to obtain a strongly connected topology by adjusting the transmission power of every node in the network. The Hitch-Hiking mechanism is used for that.…”

Section: Power Controlmentioning

confidence: 99%

Avoiding energy-compromised hotspots in resource-limited wireless networks

2008

View full text Add to dashboard Cite

The vast literature on the wireless sensor research community contains many valuable proposals far managing energy consumption, the most important factor that determines sensors lifetime. Interesting researches have been facing this requirement by focusing on the extension of the entire netwark lifetime: either by switching between node states (active, sleep), or by using energy efficient routing. We argue that a better extension of the network lifetime can be obtained if an efficient combination of management mechanisms can be performed at the energy of each single sensor and at the load distribution over the network. Considering these two accuracy levels (i.e., node and network), this paper presents a new approach that uses cost functions to choose energy efficient routes. In particular, by making different energy considerations at anode level, our approach distributes routing load, avoiding thus, energy-compromised hotspots that may cause network disconnections. The proposed cost functions have completely decentralized and adaptive behavior and take into consideration: the end-to-end energy consumption, the remaining energy of nodes, and the number of transmissions anode can make before its energy depletion. Our simulation results show that, though slightly increasing path lengths from sensor to sink nodes, the proposed scheme (I) improves significantly the network lifetime for different neighborhood densities degrees, while (2) preserves network connectivity for a longer period of time.

show abstract

Topology control in ad hoc wireless networks with hitch-hiking

Cited by 15 publications

References 22 publications

Energy Issues and Energy Aware Routing in Wireless Ad Hoc Networks

Energy Issues and Energy Aware Routing in Wireless Ad Hoc Networks

Looking for network functionalities’ extension by avoiding energy-compromised hotspots in wireless sensor networks

Avoiding energy-compromised hotspots in resource-limited wireless networks

Contact Info

Product

Resources

About