Throughput Capacity of Opportunistic Routing in Wireless Sensor Networks
Recently, the idea of opportunistic routing (OR) has been widely explored to cope with the unreliable transmissions by exploiting the broadcast nature and spatial diversity of the wireless medium in order to improve the performance of wireless sensor networks. However, there are few theoretical anal...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2010-06-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1155/2010/148359 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832553284989091840 |
|---|---|
| author | Xiaoguang Niu Li Cui |
| author_facet | Xiaoguang Niu Li Cui |
| author_sort | Xiaoguang Niu |
| collection | DOAJ |
| description | Recently, the idea of opportunistic routing (OR) has been widely explored to cope with the unreliable transmissions by exploiting the broadcast nature and spatial diversity of the wireless medium in order to improve the performance of wireless sensor networks. However, there are few theoretical analyses on the maximum throughput of OR WSNs. This paper is the first attempt to conduct a theoretical analysis on aggregate throughput capacity of OR in multihop many-to-one WSNs with consideration for lossy link and transmission fairness. By capturing the key characteristics of forwarding candidate set in OR networks, we propose the cumulative delivery transmission model. Then we introduce the concept of concurrent schedulable set to represent the constraints imposed by the transmission conflicts of OR, and formulate the optimal aggregate throughput problem as a maximum concurrent flow linear programming problem. Simulation results demonstrate that the OR design derived from our analysis model often yields noticeably better throughput than traditional unicast routing protocols and the OR design derived from existing analysis model under a range of scenarios. |
| format | Article |
| id | doaj-art-adb2a5eed39f4956947a56313fbee94d |
| institution | Kabale University |
| issn | 1550-1477 |
| language | English |
| publishDate | 2010-06-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-adb2a5eed39f4956947a56313fbee94d2025-02-03T05:54:31ZengWileyInternational Journal of Distributed Sensor Networks1550-14772010-06-01610.1155/2010/148359Throughput Capacity of Opportunistic Routing in Wireless Sensor NetworksXiaoguang Niu0Li Cui1 Graduate School of Chinese Academic of Sciences, Beijing 100049, China Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, ChinaRecently, the idea of opportunistic routing (OR) has been widely explored to cope with the unreliable transmissions by exploiting the broadcast nature and spatial diversity of the wireless medium in order to improve the performance of wireless sensor networks. However, there are few theoretical analyses on the maximum throughput of OR WSNs. This paper is the first attempt to conduct a theoretical analysis on aggregate throughput capacity of OR in multihop many-to-one WSNs with consideration for lossy link and transmission fairness. By capturing the key characteristics of forwarding candidate set in OR networks, we propose the cumulative delivery transmission model. Then we introduce the concept of concurrent schedulable set to represent the constraints imposed by the transmission conflicts of OR, and formulate the optimal aggregate throughput problem as a maximum concurrent flow linear programming problem. Simulation results demonstrate that the OR design derived from our analysis model often yields noticeably better throughput than traditional unicast routing protocols and the OR design derived from existing analysis model under a range of scenarios.https://doi.org/10.1155/2010/148359 |
| spellingShingle | Xiaoguang Niu Li Cui Throughput Capacity of Opportunistic Routing in Wireless Sensor Networks International Journal of Distributed Sensor Networks |
| title | Throughput Capacity of Opportunistic Routing in Wireless Sensor Networks |
| title_full | Throughput Capacity of Opportunistic Routing in Wireless Sensor Networks |
| title_fullStr | Throughput Capacity of Opportunistic Routing in Wireless Sensor Networks |
| title_full_unstemmed | Throughput Capacity of Opportunistic Routing in Wireless Sensor Networks |
| title_short | Throughput Capacity of Opportunistic Routing in Wireless Sensor Networks |
| title_sort | throughput capacity of opportunistic routing in wireless sensor networks |
| url | https://doi.org/10.1155/2010/148359 |
| work_keys_str_mv | AT xiaoguangniu throughputcapacityofopportunisticroutinginwirelesssensornetworks AT licui throughputcapacityofopportunisticroutinginwirelesssensornetworks |