On the design of device-to-device autonomous discovery

This paper proposes a synchronous device discovery solution for ad-hoc networks based on the observations that time synchronization, along with an FDM based channel resource allocation, can lead to gains in terms of energy consumption, discovery range, and the number of devices discovered. These attributes are important for the success of proximity-aware networking, where devices autonomously find peer-groups over human mobility scales. In this paper, we develop the PHY and MAC protocols to enable autonomous device discovery. Using both simulations and stochastic-geometry based analysis, we validate our design, and argue that there can be significant gains over a conventional Wi-Fi based solution.

[1]  Lorenzo Vangelista,et al.  Joint Discovery in Synchronous Wireless Networks , 2011, IEEE Transactions on Communications.

[2]  Michèle Basseville,et al.  Detection of Abrupt Changes: Theory and Applications. , 1995 .

[3]  Hannu Verkasalo,et al.  Contextual patterns in mobile service usage , 2009, Personal and Ubiquitous Computing.

[4]  Anthony Ephremides,et al.  An asynchronous neighbor discovery algorithm for wireless sensor networks , 2007, Ad Hoc Networks.

[5]  Jun Luo,et al.  Neighbor discovery in wireless ad hoc networks based on group testing , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[6]  Yang Xiao,et al.  IEEE 802.11n: enhancements for higher throughput in wireless LANs , 2005, IEEE Wireless Communications.

[7]  Junyi Li,et al.  Toward proximity-aware internetworking , 2010, IEEE Wireless Communications.

[8]  Sanjay Shakkottai,et al.  FlashLinQ: A synchronous distributed scheduler for peer-to-peer ad hoc networks , 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[9]  Loren G. Terveen,et al.  Putting systems into place: a qualitative study of design requirements for location-aware community systems , 2004, CSCW.

[10]  François Baccelli,et al.  On optimizing CSMA for wide area ad hoc networks , 2011, 2011 International Symposium of Modeling and Optimization of Mobile, Ad Hoc, and Wireless Networks.

[11]  Jeffrey G. Andrews,et al.  Stochastic geometry and random graphs for the analysis and design of wireless networks , 2009, IEEE Journal on Selected Areas in Communications.

[12]  Donald F. Towsley,et al.  On neighbor discovery in wireless networks with directional antennas , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[13]  Jian Ni,et al.  Coloring Spatial Point Processes With Applications to Peer Discovery in Large Wireless Networks , 2011, IEEE/ACM Transactions on Networking.

[14]  Steven A. Borbash,et al.  Birthday protocols for low energy deployment and flexible neighbor discovery in ad hoc wireless networks , 2001, MobiHoc '01.

[15]  Eija Kaasinen,et al.  User needs for location-aware mobile services , 2003, Personal and Ubiquitous Computing.

[16]  François Baccelli,et al.  Stochastic geometry and wireless networks , 2009 .

[17]  Leandros Tassiulas,et al.  Proximity awareness and fast connection establishment in Bluetooth , 2000, 2000 First Annual Workshop on Mobile and Ad Hoc Networking and Computing. MobiHOC (Cat. No.00EX444).