A channel access scheme for large dense packet radio networks
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Summary cache: a scalable wide-area Web cache sharing protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
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
A scalable location service for geographic ad hoc routing
MobiCom '00 Proceedings of the 6th annual 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
Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Randomized location service in mobile ad hoc networks
MSWIM '03 Proceedings of the 6th ACM international workshop on Modeling analysis and simulation of wireless and mobile systems
Receiver-oriented design of Bloom filters for data-centric routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
A distributed location service for MANET using swarm intelligence
MWS'09 Proceedings of the 2009 IEEE conference on Mobile WiMAX
| Hi-index | 0.00 |
In a network consists of wireless mobile nodes, routing with geographical information is more efficient and scalable than methods that only relay on node connectivities. Geographical routing requires a distributed location dissemination or location database system to provide forwarding location. In this paper, we propose a novel location dissemination system called "Geographical Region Summary Service"(GRSS). Mobile nodes in GRSS proactively disseminate aggregated forwarding locations as a summary of node IDs in a defined region. This summary propagates to other regions and updates stale summaries. Each node in the network knows the exact location of every other node, or the region it resides in. Packet forwarding decisions can be made independently at each node. We introduce the system and algorithm, also summarize some findings from our simulation results in this paper