Routing in Outer Space: Improved Security and Energy-Efficiency in Multi-Hop Wireless Networks

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Short version invited to INFOCOM 2008 mini-conference

Scientific paper

In this paper we consider security-related and energy-efficiency issues in multi-hop wireless networks. We start our work from the observation, known in the literature, that shortest path routing creates congested areas in multi-hop wireless networks. These areas are critical--they generate both security and energy efficiency issues. We attack these problems and set out routing in outer space, a new routing mechanism that transforms any shortest path routing protocol (or approximated versions of it) into a new protocol that, in case of uniform traffic, guarantees that every node of the network is responsible for relaying the same number of messages, on expectation. We can show that a network that uses routing in outer space does not have congested areas, does not have the associated security-related issues, does not encourage selfish positioning, and, in spite of using more energy globally, lives longer of the same network using the original routing protocol.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Routing in Outer Space: Improved Security and Energy-Efficiency in Multi-Hop Wireless Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Routing in Outer Space: Improved Security and Energy-Efficiency in Multi-Hop Wireless Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Routing in Outer Space: Improved Security and Energy-Efficiency in Multi-Hop Wireless Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-134627

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.