ABSTRACT
The recent surge in the use of mobile devices have opened up new avenues for communication. While most existing applications designed to exploit this potential are infrastructure based, there is a growing trend to leverage physical proximity between end-users to enable direct peer-to-peer communication. However, the success of these applications relies on the ability to efficiently detect contact opportunities, Devices that participate in such opportunistic communication often come equipped with multiple radios. For an individual node, performing neighbor discovery can be too expensive with a high-power, long-range radio (e.g., Wi-Fi). On the other hand, relying only on a low-power, short-range radio for detecting neighbors results in significantly fewer available contacts. To mitigate this problem, we have developed CQuest, a novel scheme for more efficient long-range neighbor discovery that leverages the clustering of nodes as well as the radio heterogeneity of mobile devices. The basic idea is that coordination over a low-power, short-range radio can help clustered nodes distribute the load of high-power, long-range scanning. We present results from extensive simulation that shows CQuest discovers significantly more contacts than a low-power only scheme but without incurring the high energy cost usually associated with long-range discovery. We also present results and experience from a successful implementation of the protocol on a testbed of Android G1/G2 phones that shows the feasibility of the protocol in a real network.
- ns2 network simulator. http://www.isi.edu/nsnam/ns/.Google Scholar
- Opportunistic network enivonrment ONE. http://www.netlab.tkk.fi/tutkimus/dtn/theone/.Google Scholar
- G. Ananthanarayanan and I. Stoica. Blue-fi: enhancing wi-fi performance using bluetooth signals. In Mobisys '09: Proceedings of the 7th international conference on Mobile systems, applications, and services, pages 249--262, New York, NY, USA, 2009. ACM. Google ScholarDigital Library
- P. Bahl, A. Adya, J. Padhye, and A. Walman. Reconsidering wireless systems with multiple radios. SIGCOMM Comput. Commun. Rev., 34:39--46, October 2004. Google ScholarDigital Library
- N. Baldo, F. Maguolo, M. Miozzo, M. Rossi, and M. Zorzi. ns2-miracle: a modular framework for multi-technology and cross-layer support in network simulator 2. In Proceedings of ValueTools 2007, pages 16:1--16:8, ICST, Brussels, Belgium, Belgium, 2007. ICST. Google ScholarDigital Library
- W. He, Y. Huang, K. Nahrstedt, and B. Wu. Message propagation in ad-hoc-based proximity mobile social networks. In Proceedings of Pervasive Computing and Communications Workshops 2010, pages 141--146, 29 2010-april 2 2010.Google ScholarCross Ref
- W. jen Hsu and A. Helmy. On nodal encounter patterns in wireless lan traces. IEEE Transactions on Mobile Computing, 9:1563--1577, November 2010. Google ScholarDigital Library
- A. Kandhalu, K. Lakshmanan, and R. R. Rajkumar. U-connect: a low-latency energy-efficient asynchronous neighbor discovery protocol. In Proceedings of IPSN 2010, pages 350--361, 2010. Google ScholarDigital Library
- M. Motani, V. Srinivasan, and P. S. Nuggehalli. Peoplenet: engineering a wireless virtual social network. In Proceedings of MobiCom 2005, pages 243--257, New York, NY, USA, 2005. ACM. Google ScholarDigital Library
- M. Musolesi and C. Mascolo. A community based mobility model for ad hoc network research. In Proceedings of the 2nd international workshop on Multi-hop ad hoc networks: from theory to reality, REALMAN '06, pages 31--38, New York, NY, USA, 2006. ACM. Google ScholarDigital Library
- A. K. Pietiläinen, E. Oliver, J. Lebrun, G. Varghese, and C. Diot. MobiClique: middleware for mobile social networking. In Proceedings of the 2nd ACM workshop on Online social networks, pages 49--54. ACM, August 2009. Google ScholarDigital Library
- J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau. CRAWDAD trace cambridge/haggle/imote/infocom (v. 2006-01-31), Jan 2006.Google Scholar
- E. Shih, P. Bahl, and M. J. Sinclair. Wake on wireless: an event driven energy saving strategy for battery operated devices. In Proceedings of the 8th MobiCom, pages 160--171, NY, USA, 2002. ACM. Google ScholarDigital Library
- T. Spyropoulos, K. Psounis, and C. S. Raghavendra. Spray and wait: An efficient routing scheme for intermittently connected mobile networks. In Proc. SIGCOMM Workshop on Delay-tolerant networking, 2005. Google ScholarDigital Library
- L. Vu, D. Quang, and K. Nahrstedt. Lessons learned from bluetooth/wifi scanning deployment in university campus. Technical report, Department of Computer Science, University of Illinois, 2010.Google Scholar
- Z. Yang, B. Zhang, J. Dai, A. Champion, D. Xuan, and D. Li. E-smalltalker: A distributed mobile system for social networking in physical proximity. In Proceedings of ICDCS 2010, pages 468--477, June 2010. Google ScholarDigital Library
United we find: enabling mobile devices to cooperate for efficient neighbor discovery
Recommendations
OpenHaystack Mobile - Tracking Custom Find My Accessories on Smartphones
WiSec '22: Proceedings of the 15th ACM Conference on Security and Privacy in Wireless and Mobile NetworksIn 2021 OpenHaystack on macOS was the first step into liberating Apple's Find My technology to be integrated into any Bluetooth-capable device. By using custom firmware for microchips like the ESP32, it was possible to build custom trackable accessories ...
Find relationship among applications
Along with extensive use of smart phone, plenty of apps are released to help users. Apps contain many relationships such as one app needs another app to cooperate. This relationship cannot be dug only by user's log or latent contexts. Fortunately, apps ...
A condensed representation to find frequent patterns
PODS '01: Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systemsGiven a large set of data, a common data mining problem is to extract the frequent patterns occurring in this set. The idea presented in this paper is to extract a condensed representation of the frequent patterns called disjunction-free sets, instead ...
Comments