Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Negotiation-based protocols for disseminating information in wireless sensor networks
Wireless Networks - Selected Papers from Mobicom'99
EnviroTrack: Towards an Environmental Computing Paradigm for Distributed Sensor Networks
ICDCS '04 Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS'04)
TinyDB: an acquisitional query processing system for sensor networks
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
DART: dynamic address routing for scalable ad hoc and mesh networks
IEEE/ACM Transactions on Networking (TON)
A Combined Routing Layer for Wireless Sensor Networks and Mobile Ad-Hoc Networks
SENSORCOMM '08 Proceedings of the 2008 Second International Conference on Sensor Technologies and Applications
IEEE Transactions on Parallel and Distributed Systems
Federated and Shared Use of Sensor Networks through Security Middleware
ITNG '09 Proceedings of the 2009 Sixth International Conference on Information Technology: New Generations
Location-Aware Affinity Propagation Clustering in Wireless Sensor Networks
WIMOB '09 Proceedings of the 2009 IEEE International Conference on Wireless and Mobile Computing, Networking and Communications
Towards trustworthy shared networked sensor-actuator systems
Proceedings of the Sixth Annual Workshop on Cyber Security and Information Intelligence Research
M-DART: multi-path dynamic address routing
Wireless Communications & Mobile Computing
Hi-index | 0.24 |
Traditionally routing in computer networks has focused on finding paths along which data packets could be delivered to pre-identified destination nodes. Most existing routing protocols rely on the use of network addresses as unique node or group identifiers that are usually numeric and independent of any application semantics. The semantically-oblivious identification has forced network designers to incorporate resource/service discovery techniques at higher layers of the network stack, resulting in unnecessary overhead. While such overhead can be tolerated in high-speed wired networks, it significantly limits performance and network lifetime in wireless infrastructure-less networks with battery-powered resource-constrained devices like sensor networks. Moreover, sensor nodes are more naturally anonymous and therefore assigning unique identifiers to individual node limits network scalability and imposes significant overhead on resource management. In this paper, we propose associative routing as a class of routing protocols that enables dynamic semantically-rich descriptive identification of network resources and services. As such, associative routing presents a clear departure from most current network addressing schemes, eliminating the need for a separate phase of resource/service discovery. We hypothesize that since, in essence, resource discovery operates similarly to path discovery then both can be performed in a single phase, leading to significant reduction in traffic load and communication latency without any loss of generality. We also propose a framework for associative routing and present adaptive multi-criteria routing (AMCR) protocol as a realization of associative routing for sensor networks. AMCR exploits application-specific message semantics, represented as generic criteria, and adapts its operation according to observed traffic patterns. Analytical results demonstrate the effectiveness, efficiency, and scalability of AMCR.