Spiralchord: a space-filling curve based location awareness, cross-layering P2P file sharing system in WMNs

https://doi.org/10.1016/S1005-8885(11)60264-1Get rights and content

Abstract

The common characteristics of peer-to-peer (P2P) overlay networks and wireless multi-hop network, such as self-organization, decentralization, hop-by-hop message transmission mode and high degree of dynamicity, lead to research of operating wired P2P applications on wireless multi-hop networks. Wireless mesh network (WMN) as a relative static multi-hop wireless network which is extended from Ad-Hoc networks, has become one of the key technologies for providing increased network coverage of Internet infrastructures. This paper investigates the problem of enabling P2P file sharing in WMNs. A special chord algorithm—spiralchord is proposed to address the major problem in wireless file sharing system—how to efficiently find resources currently available. Spiralchord put forward an identifier (ID) assignment technique based on spiral space-filling curve to integrate location-awareness with cross-layering. Location awareness aims at alleviating the mismatch of physical network topology and overlay network topology, and requires close-by IDs in logical ring of neighboring peers, while cross-layering aims at speeding up resource lookup operations, requires faraway IDs of neighboring peers. Spiralchord uses spiral curve to assign peers' IDs which meet the contradictory requirements of location-awareness and cross-layering. The simulation results show spiralchord is effective in reducing message overhead, and increasing lookup performance with respect to basic chord.

References (12)

  • H Sözer et al.

    A peer-to-peer file search and download protocol for wireless Ad-Hoc networks

    Computer Communications

    (2009)
  • C Canali et al.

    Enabling efficient peer-to-peer resource sharing in wireless mesh networks

    IEEE Transactions on Mobile Computing

    (2010)
  • BC Nicholas et al.

    Revisiting the TTL based controlled flooding search: optimality and randomization

  • HY Young et al.

    Reactive chord for wireless networks

  • R Kummer et al.

    Practical DHT lookup in mobile ad-hoc networks

    Proceedings of the 4th MiNEMA Workshop in Sintra, Jul 2–3, 2006, Sintra, Portugal

    (2006)
  • S Bashir et al.

    KELOP: distributed key-value lookup in wireless ad hoc networks

There are more references available in the full text version of this article.

Cited by (0)

View full text