A reliable multicast framework for light-weight sessions and application level framing
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
The MASC/BGMP architecture for inter-domain multicast routing
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Session directories and scalable Internet multicast address allocation
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Scalable data naming for application level framing in reliable multicast
MULTIMEDIA '98 Proceedings of the sixth ACM international conference on Multimedia
Adaptive web caching: towards a new global caching architecture
Computer Networks and ISDN Systems - Selected papers of the 3rd international caching workshop
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Next century challenges: mobile networking for “Smart Dust”
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
The design and implementation of an intentional naming system
Proceedings of the seventeenth ACM symposium on Operating systems principles
Wireless integrated network sensors
Communications of the ACM
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
Ethernet: distributed packet switching for local computer networks
Communications of the ACM - Special 25th Anniversary Issue
Operating Systems, An Advanced Course
Paradigms for Structure in an Amorphous Computer
Paradigms for Structure in an Amorphous Computer
Distributed assignment of encoded MAC addresses in sensor networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Building efficient wireless sensor networks with low-level naming
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed On-Demand Address Assignment in Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Communication protocols for sensor networks
Wireless sensor networks
Virtual Grid Spatial Reusing Algorithm for MAC Address Assignment in Wireless Sensor Network
International Journal of Distributed Sensor Networks - Advances on Heterogeneous Wireless Sensor Networks
Energy efficient node addressing scheme in self-organised sensor networks
International Journal of Communication Networks and Distributed Systems
A survey of addressing algorithms for wireless sensor networks
WiCOM'09 Proceedings of the 5th International Conference on Wireless communications, networking and mobile computing
Agent-based routing for wireless sensor network
ICIC'07 Proceedings of the intelligent computing 3rd international conference on Advanced intelligent computing theories and applications
An energy consumption analysis of the Wireless HART TDMA protocol
Computer Communications
Hi-index | 0.00 |
Abstract: Recent advances in miniaturization and low-cost, low-power design have led to active research in large-scale, highly distributed systems of small, wireless, low-power, unattended sensors and actuators. We explore the use of Random, Ephemeral TRansaction Identifiers (RETRI) in such systems, and contrast it with the typical design philosophy of using static identifiers in roles such as node addressing or efficient data naming. Instead of using statically assigned identifiers that are guaranteed to be unique, nodes randomly select probabilistically unique identifiers for each new transaction. We show how this randomized scheme can significantly improve the system's energy efficiency in contexts where that efficiency is paramount, such as energy-constrained wireless sensor networks. Benefits are realized if the typical data size is small compared to the size of an identifier, and the number of transactions seen by an individual node is small compared to the number of nodes that exist in the entire system. Our scheme is designed to scale well: identifier sizes grow with a system's density, not its overall size. We quantify these benefits using an analytic model that predicts our scheme's efficiency. We also describe an implementation as applied to packet fragmentation and an experiment that validates our model.