Heterogeneous attachment strategies optimize the topology of dynamic wireless networks

Computer Science – Networking and Internet Architecture

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1140/epjb/e2010-00049-x

In optimizing the topology of wireless networks built of a dynamic set of spatially embedded agents, there are many trade-offs to be dealt with. The network should preferably be as small (in the sense that the average, or maximal, pathlength is short) as possible, it should be robust to failures, not consume too much power, and so on. In this paper, we investigate simple models of how agents can choose their neighbors in such an environment. In our model of attachment, we can tune from one situation where agents prefer to attach to others in closest proximity, to a situation where distance is ignored (and thus attachments can be made to agents further away). We evaluate this scenario with several performance measures and find that the optimal topologies, for most of the quantities, is obtained for strategies resulting in a mix of most local and a few random connections.

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

Heterogeneous attachment strategies optimize the topology of dynamic 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 Heterogeneous attachment strategies optimize the topology of dynamic wireless networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Heterogeneous attachment strategies optimize the topology of dynamic wireless networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-609326

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