Sciweavers

Share
MOBIHOC
2010
ACM
8 years 11 months ago
Spectrum pricing games with bandwidth uncertainty and spatial reuse in cognitive radio networks
In cognitive radio networks (CRN), primary users can lease out their unused bandwidth to secondary users in return for a fee. We study price competition in a CRN with multiple pri...
Gaurav S. Kasbekar, Saswati Sarkar
MOBIHOC
2010
ACM
8 years 11 months ago
Whirlpool routing for mobility
We present the Whirlpool Routing Protocol (WARP), which efficiently routes data to a node moving within a static mesh. The key insight in WARP's design is that data traffic c...
Jung Woo Lee, Branislav Kusy, Tahir Azim, Basem Sh...
MOBIHOC
2010
ACM
8 years 11 months ago
Globs in the primordial soup: the emergence of connected crowds in mobile wireless networks
In many practical scenarios, nodes gathering at points of interest yield sizable connected components (clusters), which sometimes comprise the majority of nodes. While recent anal...
Simon Heimlicher, Kavé Salamatian
MOBIHOC
2010
ACM
8 years 11 months ago
Detecting intra-room mobility with signal strength descriptors
We explore the problem of detecting whether a device has moved within a room. Our approach relies on comparing summaries of received signal strength measurements over time, which ...
Konstantinos Kleisouris, Bernhard Firner, Richard ...
MOBIHOC
2010
ACM
8 years 11 months ago
Longest-queue-first scheduling under SINR interference model
We investigate the performance of longest-queue-first (LQF) scheduling (i.e., greedy maximal scheduling) for wireless networks under the SINR interference model. This interference...
Long Bao Le, Eytan Modiano, Changhee Joo, Ness B. ...
MOBIHOC
2010
ACM
8 years 11 months ago
Breaking bidder collusion in large-scale spectrum auctions
Dynamic spectrum auction is an effective solution to provide spectrum on-demand to many small wireless networks. As the number of participants grows, bidder collusion becomes a se...
Xia Zhou, Haitao Zheng
MOBIHOC
2010
ACM
8 years 11 months ago
Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach
In geographic (or geometric) routing, messages are expected to route in a greedy manner: the current node always forwards a message to its neighbor node that is closest to the des...
Anne-Marie Kermarrec, Guang Tan
MOBIHOC
2010
ACM
8 years 11 months ago
Security-capacity trade-off in large wireless networks using keyless secrecy
We investigate the scalability of a class of algorithms that exploit the dynamics of wireless fading channels to achieve secret communication in a large wireless network of n rando...
Sudarshan Vasudevan, Dennis Goeckel, Donald F. Tow...
MOBIHOC
2010
ACM
8 years 11 months ago
Data preservation under spatial failures in sensor networks
In this paper, we address the problem of preserving generated data in a sensor network in case of node failures. We focus on the type of node failures that have explicit spatial s...
Navid Hamed Azimi, Himanshu Gupta, Xiaoxiao Hou, J...
MOBIHOC
2010
ACM
8 years 11 months ago
Identifying the missing tags in a large RFID system
Comparing with the classical barcode system, RFID extends the operational distance from inches to a number of feet (passive RFID tags) or even hundreds of feet (active RFID tags)....
Tao Li, Shigang Chen, Yibei Ling
books