A fully distributed routing algorithm for maximizing lifetime of a wireless ad hoc network

Cho, Woncheol; Kim, Seong-Lyun

doi:10.1109/mwcn.2002.1045850

Cited by 10 publications

(5 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This indicates that mobile nodes with more battery capacity will forward the RREQ earlier. Hence, the first arrived RREQ at the destination should contain an energy-rich path [18] so that the destination node can return a RREP back to the source node immediately when it receives the first RREQ.…”

Section: Discussionmentioning

confidence: 99%

“…In Chapter 6, mechanisms for the route discovery and route maintenance in HEAR are described and studied in detail. The performance of HEAR is compared with DSR, time-delay on-demand routing (TDOR) [18], hybrid routing (HYB) in terms of packet delivery ratio, number of data packet received, routing overheads, average lifetime of mobile nodes and average lifetime of communication pairs. Simulation results…”

Section: Organization Of the Thesismentioning

confidence: 99%

“…18 shows that d, performs the best with Hello frequency = l/1s when n, =15. This is probably because the higher frequency of Hello resulting in the more accuracy of NTs at mobile nodes, and hence packets can be delivered to the destinations with fewer errors.…”

mentioning

confidence: 94%

“…18 shows the distribution of mobile nodes with different clustering status for the three schemes. About 68% and 77% of mobile nodes in RCC and HCCM are member nodes covered by two or more CHs while only 57% of mobile nodes in ECS are involved in more than one cluster.…”

mentioning

confidence: 99%

“…Allowing S to use routes cached in its SRC can avoid a data packet from being dropped due to no route, although the utilized route from SRC may not be composed of energy-rich nodes. Subsequently if S discovers a new route that considers the energy metrics, it will be cached in the PRC of S, and replace the currently used route for data delivery.4) Route discovery with time delay mechanismIf a route to some D is not found in the NT or RC of S, S initiates a RREQ to discover a route to D. And a time delay mechanism[18] is introduced in the RREQ forwarding of the route discovery procedure in HEAR. When an intermediate mobile node 1M receives such a RREQ not destined to itself for the first time, it does not use routes cached in its RC for replying.…”

mentioning

confidence: 99%

See 4 more Smart Citations

Clustering and routing in mobile ad hoc networks (MANETs)

Yu¹

View full text Add to dashboard Cite

First of all, I would like to express my sincere thanks and great gratitude to my supervisor, Assistant Professor Chong Han Joo Peter. Without his intellectual guidance, constant attention and strict demands, this work would have not been completed. His extensive knowledge, enlightened direction and continuous encouragement make my Thesis work much easier. In particular, I wish to thank him for teaching me some of the philosophical aspects of research and some intangible skills, which I believe are the most invaluable knowledge that I have acquired as a PhD student. I would like to thank the centre director, Associate Professor Shum Ping, technicians and many labmates, especially Dr. Li Xuejun and Dr. Yang Ming, in Network Technology Research Centre for their guidance, support and help in the past few years. I would like to express my gratitude to my family, especially my husband and parents, for their consistent support and encouragement during my PhD study and my life. Last, but not the least, I would like to thank Nanyang Technological University for providing all the study facilities and research scholarship. III

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Organization Of the Thesismentioning

confidence: 99%

mentioning

confidence: 94%

mentioning

confidence: 99%

mentioning

confidence: 99%

See 3 more Smart Citations

Clustering and routing in mobile ad hoc networks (MANETs)

Yu¹

View full text Add to dashboard Cite

show abstract

How to Discover Optimal Routes in Wireless Multihop Networks

Gerharz

Waal

Martini

2005

IFIP International Federation for Information Processing

View full text Add to dashboard Cite

In this paper, we introduce a distributed algorithm that is able to discover optimal routes in mobile wireless multihop networks using reactive routing protocols. The algorithm is based on Dijkstra's shortest-path algorithm and maps the quality of a path to a delay of the corresponding route request to allow highquality paths to surpass low-quality paths. With a proper selection of the delay mapping, this approach yields a low overhead and interoperable integration of maximisable routing metrics into existing protocols like AODV and DSR while keeping the route setup delay at a moderate level.

show abstract

A pseudo base station based algorithm for power aware routing in UWB ad hoc networks

Choi

The Ninth International Conference onCommunications Systems, 2004. ICCS 2004.

View full text Add to dashboard Cite

The battery life of mobile hosts is one of important perfor mance indicators in ad hoc networks because networks rely on each host's battery power. In this paper, we propose a battery-life-aware routing in Ultra-wideband (UWB) ad hoc networks. The proposed routing method saves significant power in broadcasting process by leveraging a fixed wired device's power. Simulation results reveal that the proposed scheme provides good performance by using a pseudo base station and saves the power of wireless hosts up to 50%.

show abstract

A fully distributed routing algorithm for maximizing lifetime of a wireless ad hoc network

Cited by 10 publications

References 4 publications

Clustering and routing in mobile ad hoc networks (MANETs)

Clustering and routing in mobile ad hoc networks (MANETs)

How to Discover Optimal Routes in Wireless Multihop Networks

A pseudo base station based algorithm for power aware routing in UWB ad hoc networks

Contact Info

Product

Resources

About