Discrete Mathematics - Topics on domination
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
IEEE Transactions on Parallel and Distributed Systems
Routing with guaranteed delivery in ad hoc wireless networks
Wireless Networks
Introduction to Stochastic Dynamic Programming: Probability and Mathematical
Introduction to Stochastic Dynamic Programming: Probability and Mathematical
Computing shortest paths for any number of hops
IEEE/ACM Transactions on Networking (TON)
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Geometric ad-hoc routing: of theory and practice
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Geographic routing for wireless networks
Geographic routing for wireless networks
On greedy geographic routing algorithms in sensing-covered networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Batch conflict resolution algorithm with progressively accurate multiplicity estimation
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Advanced input modeling: properties of the NORTA method in higher dimensions
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
Efficient geographic routing in multihop wireless networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Geographic Random Forwarding (GeRaF) for Ad Hoc and Sensor Networks: Multihop Performance
IEEE Transactions on Mobile Computing
Design methodologies for adaptive and multimedia networks
IEEE Communications Magazine
IEEE Communications Magazine
Collision-minimizing CSMA and its applications to wireless sensor networks
IEEE Journal on Selected Areas in Communications
Focused beam routing protocol for underwater acoustic networks
Proceedings of the third ACM international workshop on Underwater Networks
Minimizing delay and maximizing lifetime for wireless sensor networks with anycast
IEEE/ACM Transactions on Networking (TON)
Optimal anycast technique for delay-sensitive energy-constrained asynchronous sensor networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
This paper presents integrated MAC/routing solutions for wireless sensor networks. At the MAC layer, every node accesses the channel according to its own cost by means of properly defined cost-dependent access probabilities. Costs are used to capture the suitability of a node to act as the relay and may depend on several factors such as residual energies, link conditions, queue state, etc. Our cost-aware MAC discriminates nodes right in the channel access phase by therefore assisting the forwarding decisions to be made at the routing level. In fact, nodes with high costs are ruled out from channel contention and are not considered when making routing decisions. This provides the routing layer with better relay candidates and, at the same time, decreases the number of in-range devices contending for the channel, thereby reducing interference. The proposed MAC scheme is coupled with routing over hop count (HC) coordinates. To this end, we introduce a set of rules designed to perform HC routing by exploiting first and second order neighborhood information. These are then integrated with our MAC scheme according to a cross-layer approach and their effectiveness is demonstrated by means of analysis and simulation.