Discrete Mathematics - Topics on domination
Wireless integrated network sensors
Communications of the ACM
The Cricket location-support system
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
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
GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
A taxonomy of wireless micro-sensor network models
ACM SIGMOBILE Mobile Computing and Communications Review
Rumor routing algorthim for sensor networks
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Asymptotically optimal geometric mobile ad-hoc routing
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Centralized broadcast in multihop radio networks
Journal of Algorithms
Worst-Case optimal and average-case efficient geometric ad-hoc routing
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Location-based pairwise key establishments for static sensor networks
Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks
IEEE Communications Magazine
Hi-index | 0.00 |
In this paper, we introduce new geometric ad-hoc routing algorithms to route queries in static sensor networks. For single-source-queries routing, we utilise centralised mechanism to accomplish a query using an optimal number of transmissions O(c), where c is the length of the shortest path between the source and the destination.For multiple-source-queries routing, the number of transmissions for each query is bounded by O(c log n), where n is the number of nodes in the network.For both single-source and multiple-source queries, the routing stage is preceded by preprocessing stages requiring O(nD) and O(n^2 D) transmissions, respectively, where D is the diameter of the nework. Our algorithm improves the complexity of the currently best known algorithms in terms of the number of transmissions for each query.The preprocessing is worth-while if it is followed by frequent queries.We could also imagine that there is an extra initial power (say, batteries) available during the preprocessing stage or alternatively the position of the sensors are known in advance and the preprocessing can be done before the sensors are deployed in the field.It also worths mentioning that a lower bound of 驴(c^2 ) transmissions has been proved if preprocessing is not allowed.