IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005.
DOI: 10.1109/mahss.2005.1542857
|View full text |Cite
|
Sign up to set email alerts
|

An efficient N-to-1 multipath routing protocol in wireless sensor networks

Abstract: Abstract-A typical task in a wireless sensor network is that every sensor node senses its local environment and, upon request, sends the data of interest back to a base station. Based on this many-to-one communication pattern, we first propose a distributed N-to-1 multipath discovery protocol which distinguishes from other multipath routing protocols in that it is able to find multiple node-disjoint paths from every sensor node to the base station simultaneously in one route discovery process. Then we propose … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
6
0

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 41 publications
(8 citation statements)
references
References 19 publications
0
6
0
Order By: Relevance
“…The results show that the proposed scheme results in a higher energy efficiency. In [20], authors proposed an N-to-1 multipath routing protocol, in which nodes are arranged in a spanning tree. Multipaths are constructed by traversing the tree.…”
Section: Related Workmentioning
confidence: 99%
“…The results show that the proposed scheme results in a higher energy efficiency. In [20], authors proposed an N-to-1 multipath routing protocol, in which nodes are arranged in a spanning tree. Multipaths are constructed by traversing the tree.…”
Section: Related Workmentioning
confidence: 99%
“…Similar to MCMP, this protocol also improves data transmission reliability through introducing some data redundancy into the data transmission process. N-to-1 multipath routing [18] considers reliability as the primary demand of its intended application. The route construction phase utilizes spanning tree formation to find the shortest paths to the sink.…”
Section: Related Workmentioning
confidence: 99%
“…Non-leaf nodes renew the delay according to this. If DUCF is not equal to1 or renewing d is not necessary, synchronization can be achieved only by equation (2) and equation (3). DUCF increases as the network requirement for synchronization precision declines, precision requirement is most strict when DUCF is 1, and it is also the highest precision that PBTS can provide.…”
Section: Pair-wise Broadcast Time Synchronizationmentioning
confidence: 99%
“…same time a research focus [2][3] . Nevertheless, either the synchronization algorithm or the highly reliable routine protocols specially for the industrial communication network has yet been taken into consideration by few records.…”
mentioning
confidence: 99%