No abstract available.
Proceeding Downloads
Deterministic greedy routing with guaranteed delivery in 3D wireless sensor networks
With both computational complexity and storage space bounded by a small constant, greedy routing is recognized as an appealing approach to support scalable routing in wireless sensor networks. However, significant challenges have been encountered in ...
O3: optimized overlay-based opportunistic routing
Opportunistic routing achieves significant performance gain under lossy wireless links. In this paper, we develop a novel approach that exploits inter-flow network coding in opportunistic routing. A unique feature of our design is that it systematically ...
Neighbor discovery in wireless networks with multipacket reception
Neighbor discovery is one of the first steps in configuring and managing a wireless network. Most existing studies on neighbor discovery assume a single-packet reception model where only a single packet can be received successfully at a receiver. In ...
Broadcasting delay-constrained traffic over unreliable wireless links with network coding
There is increasing demand for using wireless networks for applications that generate packets with strict per-packet delay constraints. In addition to delay constraints, such applications also have various traffic patterns and require guarantees on ...
OmniVoice: a mobile voice solution for small-scale enterprises
We consider the problem of providing mobility support for Voice-over-IP (VoIP) traffic in small-scale enterprises. There is considerable interest in providing on-the-go support for VoIP through the use of WiFi-enabled smart phones. However, existing ...
Enabling coexistence of heterogeneous wireless systems: case for ZigBee and WiFi
The ISM spectrum is becoming increasingly populated by emerging wireless networks. Spectrum sharing among the same network of devices can be arbitrated by MAC protocols (e.g., CSMA), but the coexistence between heterogeneous networks remains a ...
The hare and the tortoise: taming wireless losses by exploiting wired reliability
- Anirudh Badam,
- Michael Kaminsky,
- Dongsu Han,
- Konstantina Papagiannaki,
- David G. Andersen,
- Srinivasan Seshan
Multiple communication channels are common in today's consumer and enterprise networks. For example, a high bandwidth but unreliable wireless network might co-exist with a reliable wired link (EWLANs and neighborhood networks). In this paper, we present ...
A market-clearing model for spectrum trade in cognitive radio networks
We model cognitive radio networks (CRNs) as a spectrum market where every primary user (PU) offer her subchannels with certain interference bound indicating the interference limit the PU can tolerate, and secondary users (SUs) purchase the right to ...
Truthful auction for cooperative communications
On one hand, cooperative communication has been gaining more and more popularity since it has great potential to increase the capacity of wireless networks. On the other hand, the applications of cooperative communication technology are rarely seen in ...
Non-cooperative spectrum access: the dedicated vs. free spectrum choice
We consider a dynamic spectrum access system in which Secondary Users (SUs) choose to either acquire dedicated spectrum or to use spectrum-holes (white spaces) which belong to Primary Users (PUs). The tradeoff incorporated in this decision is between ...
Wireless coverage with disparate ranges
One of the most fundamental task of wireless networks is to provide coverage of a set of targets. Suppose that all nodes and targets lie in a plane, and all nodes have circular coverage ranges of arbitrary radii. The problem Minimum Wireless Cover (MWC) ...
Barrier coverage in camera sensor networks
Barrier coverage has attracted much attention in the past few years. However, most of the previous works focused on traditional scalar sensors. We propose to study barrier coverage in camera sensor networks. One fundamental difference between camera and ...
Local connectivity tests to identify wormholes in wireless networks
A wormhole attack places two radio transceivers connected by a high capacity link and retransmits wireless signals from one antenna at the other. This creates a set of shortcut paths in the network, and may attract a lot of traffic to the wormhole link. ...
UNFOLD: uniform fast on-line boundary detection for dynamic 3D wireless sensor networks
A wireless sensor network becomes dynamic if it is monitoring a time-variant event (e.g., expansion of oil spill in ocean). In such applications, on-line boundary detection is a crucial function, as it allows us to track the event variation in a timely ...
Self-stabilizing leader election for single-hop wireless networks despite jamming
Electing a leader is a fundamental task in distributed computations. Many coordination problems, such as the access to a shared resource, and the resulting inefficiencies, can be avoided by relying on a leader. This paper presents Select, a leader ...
Towards cheat-proof cooperative relay for cognitive radio networks
In cognitive radio networks, cooperative relay is a new technology that can significantly improve spectrum efficiency and system throughput. While the existing protocols for cooperative relay are very interesting and useful, there is a crucial problem ...
Dispatch-and-search: dynamic multi-ferry control in partitioned mobile networks
We consider the problem of disseminating data from a base station to a sparse, partitioned mobile network by controllable data ferries with limited ferry-node and ferry-ferry communication ranges. Existing solutions to data ferry control mostly assume ...
Putting contacts into context: mobility modeling beyond inter-contact times
Realistic mobility models are crucial for the simulation of Delay Tolerant and Opportunistic Networks. The long standing benchmark of reproducing realistic pairwise statistics (e.g., contact and inter-contact time distributions) is today mastered by ...
Towards optimal rate allocation for data aggregation in wireless sensor networks
This paper aims at achieving optimal rate allocation for data aggregation in wireless sensor networks. We first formulate this rate allocation problem as a network utility maximization problem. Due to its non-convexity, we take a couple of variable ...
Scheduling algorithms for video multicasting with channel diversity in wireless OFDMA networks
The demand for real-time video services coupled with the need for increased spectral efficiencies has brought a lot of attention to video multicasting in next generation OFDMA systems. Layered video provides an efficient solution to address the channel ...
Utility optimal scheduling in energy harvesting networks
In this paper, we show how to achieve close-to-optimal utility performance in energy harvesting networks with only finite capacity energy storage devices. In these networks, nodes are capable of harvesting energy from the environment. The amount of ...
Turning off radios to save power in multi-radio wireless mesh networks
Endowing mesh routers with multiple radios is a recent solution to improve the performance of wireless mesh networks (WMNs). The problem how to route flows and assign channels to radios in multi-radio WMNs has attracted a lot of attention in the recent ...
EM-MAC: a dynamic multichannel energy-efficient MAC protocol for wireless sensor networks
Medium access control (MAC) protocols for wireless sensor networks face many challenges, including energy-efficient operation and robust support for varying traffic loads, in spite of effects such as wireless interference or even possible wireless ...
On optimal energy efficient convergecasting in unreliable sensor networks with applications to target tracking
In this paper, we develop a mathematical framework for studying the problem of maximizing the "information" received at the sink in a data gathering wireless sensor network. We explicitly account for unreliable links, energy constraints, and in-network ...
Energy-efficient polling protocols in RFID systems
Future RFID technologies will go far beyond today's widely-used passive tags. Battery-powered active tags are likely to gain more popularity due to their long operational ranges and richer on-tag resources. With integrated sensors, these tags can ...
Index Terms
- Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Recommendations
Acceptance Rates
Year | Submitted | Accepted | Rate |
---|---|---|---|
MobiHoc '21 | 139 | 28 | 20% |
Mobihoc '17 | 170 | 27 | 16% |
MobiHoc '15 | 250 | 37 | 15% |
MobiHoc '14 | 211 | 40 | 19% |
MobiHoc '13 | 234 | 42 | 18% |
MobiHoc S3 '09 | 12 | 12 | 100% |
MobiHoc '04 | 275 | 24 | 9% |
MobiHoc '03 | 192 | 27 | 14% |
MobiHoc '02 | 134 | 22 | 16% |
MobiHoc '01 | 144 | 24 | 17% |
MobiHoc '00 | 82 | 13 | 16% |
Overall | 1,843 | 296 | 16% |