Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Honeycomb Networks: Topological Properties and Communication Algorithms
IEEE Transactions on Parallel and Distributed Systems
Next century challenges: scalable coordination in sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geography-informed energy conservation for Ad Hoc routing
Proceedings of the 7th annual international conference on Mobile computing and networking
Proceedings of the 7th annual international conference on Mobile computing and networking
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Understanding packet delivery performance in dense wireless sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Taming the underlying challenges of reliable multihop routing in sensor networks
Proceedings of the 1st international conference on Embedded networked sensor systems
Networking issues in wireless sensor networks
Journal of Parallel and Distributed Computing
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey of communication/networking in Smart Grids
Future Generation Computer Systems
Fast track article: Reliable networks with unreliable sensors
Pervasive and Mobile Computing
Hi-index | 0.00 |
Geographic Adaptive Fidelity (GAF) is an important topology control approach in Wireless Sensor Networks. It extends the system lifetime by exploiting node redundancy. However, the properties of the square grid in GAF have not been fully studied. This paper shows that there exists an unreachable corner in the GAF grid architecture. Using an analytical model, we are able to calculate the unreachable probability and analyse its impacts on data delivery. We propose to replace the square grid of GAF with Hexagonal Tessellation (GAF-h). We then proceed to prove that GAF-h is able to achieve zero loss with little extra cost when compared to the original scheme. A node association algorithm is also proposed for efficient implementation. This algorithm is proved to integrate with the original GAF protocol with little computing overhead.