PAMAS—power aware multi-access protocol with signalling for ad hoc networks
ACM SIGCOMM Computer Communication Review
Energy-efficient randomized routing in radio networks
DIALM '00 Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications
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
System architecture directions for networked sensors
ASPLOS IX Proceedings of the ninth international conference on Architectural support for programming languages and operating systems
Energy-Efficient Permutation Routing in Radio Networks
IEEE Transactions on Parallel and Distributed Systems
Energy efficient Modulation and MAC for Asymmetric RF Microsensor Systems
ISLPED '01 Proceedings of the 2001 international symposium on Low power electronics and design
Time synchronization in ad hoc networks
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Comparison of broadcasting techniques for mobile ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Models of parallel computation: a survey and synthesis
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Flooding strategy for target discovery in wireless networks
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Dynamic Reconfiguration: Architectures and Algorithms (Series in Computer Science (Kluwer Academic/Plenum Publishers).)
The impact of spatial correlation on routing with compression in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
On the scalability of hierarchical cooperation for dense sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Algorithm Design and Synthesis for Wireless Sensor Networks
ICPP '04 Proceedings of the 2004 International Conference on Parallel Processing
Supporting Topographic Queries in a Class of Networked Sensor Systems
PERCOMW '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications Workshops
Formation of a geometric pattern with a mobile wireless sensor network
Journal of Robotic Systems
Relative location estimation in wireless sensor networks
IEEE Transactions on Signal Processing
Lower bounds on data collection time in sensory networks
IEEE Journal on Selected Areas in Communications
Simple and efficient geographic routing around obstacles for wireless sensor networks
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Hi-index | 0.00 |
Towards building a systematic methodology of algorithm design for applications of networked sensor systems, we formally define two link-wise communication models, the Collision Free Model (CFM) and the Collision Aware Model (CAM). While CFM provides ease of programming and analysis for high level application functionality, CAM enables more accurate performance analysis and hence more efficient algorithms through cross-layer optimization, at the expense of increased programming and analysis complexity. These communication models are part of an abstract network model, above which algorithm design and performance optimization is performed. We use the example of optimizing a probability based broadcasting scheme under CAM to illustrate algorithm optimization based on the defined models. Specifically, we present an analytical framework that facilitates an accurate modeling and analysis for the probability based broadcasting in CAM (PB_CAM). Our analytical results indicate that (1) the optimal broadcast probability for either maximizing the reachability within a given latency constraint or minimizing the latency for a given reachability constraint decreases rapidly with node density, and (2) the optimal probability for either maximizing the reachability with a given energy constraint or minimizing the energy cost for a given reachability constraint varies slowly between 0 and 0.1 over the entire range of the variations in node density. Our analysis is also confirmed by extensive simulation results.