A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Routing with guaranteed delivery in ad hoc wireless networks
DIALM '99 Proceedings of the 3rd international workshop on Discrete algorithms and methods for mobile computing and communications
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Geocasting in Mobile Ad Hoc Networks: Location-Based Multicast Algorithms
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Impact of radio irregularity on wireless sensor networks
Proceedings of the 2nd international conference on Mobile systems, applications, and services
Path Vector Face Routing: Geographic Routing with Local Face Information
ICNP '05 Proceedings of the 13TH IEEE International Conference on Network Protocols
An approach to stabilize interdomain routing protocol after failure
Computers and Electrical Engineering
| Hi-index | 0.00 |
This work is part of a research project that analyzes and develops efficient technologies for street lighting systems, and it describes a wireless sensor network system used for controlling and monitoring electrical variables. The street lighting system is composed by an urban network, where delivery rate (with priority related to other aspects), latency, energy efficiency, and fault tolerance are the non-functional requirements. Based on these requirements, this work presents a new network routing mechanism with acknowledgment, named GGPSR. The main purpose is to provide new means to reach high delivery rates in urban networks, with tolerated end-to-end delay values for this type of network. The mechanism consists of selecting nodes from neighbors others than the previously selected in order to find a path towards the destination. Simulation results demonstrate the algorithm fulfills the mentioned requirements.