2007
DOI: 10.1109/tmc.2007.54
|View full text |Cite
|
Sign up to set email alerts
|

Integrated Cost-Based MAC and Routing Techniques for Hop Count Forwarding in Wireless Sensor Networks

Abstract: Abstract-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 de… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
17
0

Year Published

2008
2008
2021
2021

Publication Types

Select...
5
3
1

Relationship

1
8

Authors

Journals

citations
Cited by 24 publications
(17 citation statements)
references
References 34 publications
0
17
0
Order By: Relevance
“…Alternatively, the CTS packet can include information about the network activity that each one of the candidates is measuring. In that case, routing is performed by exploiting first and second order neighborhood information for more efficient, integrated MAC/routing schemes [16]. As the authors show in [16], this information can be used as part of the relays' decision of whether and when to respond a multicast RTS.…”
Section: Focused Beam Routing Protocolmentioning
confidence: 99%
See 1 more Smart Citation
“…Alternatively, the CTS packet can include information about the network activity that each one of the candidates is measuring. In that case, routing is performed by exploiting first and second order neighborhood information for more efficient, integrated MAC/routing schemes [16]. As the authors show in [16], this information can be used as part of the relays' decision of whether and when to respond a multicast RTS.…”
Section: Focused Beam Routing Protocolmentioning
confidence: 99%
“…In that case, routing is performed by exploiting first and second order neighborhood information for more efficient, integrated MAC/routing schemes [16]. As the authors show in [16], this information can be used as part of the relays' decision of whether and when to respond a multicast RTS. However, such details are of no concern for the basic routing principle.…”
Section: Focused Beam Routing Protocolmentioning
confidence: 99%
“…Each node adds routing information to the sink packet as number of hops and estimated distance to the sink (extracted from Radio Signal Strength measurements, RSS). The routing is a localised routing algorithm (LRA), where only information from 1-hop neighbours is used and it adopts a sequential forwarding decision mechanism [9]. In order to make proper routing choices the routing process is made sequentially where nodes at (n+1)-hop wait enough time before retransmission enabling all n-hops' nodes to send their routing packets.…”
Section: A Initialisation: Sequential Forwarding Routingmentioning
confidence: 99%
“…Being aware of the potential next-(n-1)hop neighbours after initialisation, routing strategies at nodes are performed autonomously using congestion metrics distributed in a sequential forwarding process [7] within MAC control packets (CTS or ACK). One-hop away neighbours' information is sufficient for the routing decisions, which avoids the flooding of overhead routing control packets.…”
Section: ) Adaptivementioning
confidence: 99%