Optimal Multicommodity Spectrum-Efficient Routing in Multihop Wireless Networks

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Heat-Diffusion: Optimal Dynamic Routing for Multiclass Multihop Wireless Networks

A new routing policy, named Heat-Diffusion (HD), is developed for multiclass, multihop wireless networks subject to stochastic arrivals, randomly varying topology, and channel interference. The new policy uses only current queue backlogs and current channel states, without requiring the knowledge of topology and arrivals. We show that HD is throughput-optimal in the sense that it stabilizes all...

متن کامل

Energy-efficient Traffic-aware Multihop Routing for Wireless Sensor Networks

Since link failures and packet losses are inevitable, ad hoc wireless sensor networks may tolerate a certain level of reliability without significantly affecting packets delivery performance and data aggregation accuracy in favor of efficient energy consumption. An efficient hybrid approach is to make trade-offs between energy, reliability, cost, and agility while improving packet delivery, mai...

متن کامل

Bandwidth-Efficient Multicast Routing for Multihop, Ad-Hoc Wireless Networks

In this paper, we propose and investigate a bandwidth-efficient multicast routing protocol for ad-hoc networks. The proposed protocol achieves low communication overhead, namely, it requires a small number of control packet transmissions for route setup and maintenance. The proposed protocol also achieves high multicast efficiency, namely, it delivers multicast packets to receivers with a small...

متن کامل

Minimum Delay Routing in Multihop Wireless Networks

End-to-end delay is an important QoS metric in multihop wireless networks such as sensor networks and mesh networks. Along with throughput, end-to-end delay determines the user-experienced data transmission time. End-to-end delay refers to the total time it takes for a single packet to reach the destination. It is a result of many factors including the length of the route and the interference l...

متن کامل

Routing in Random Multihop Wireless Networks

A. Proof of Lemma 2 Lemma 2 We have ∠wut ≤ α if ‖uv‖+‖vw‖ ≤ r, ∠vut ≤ α and ∠wvt ≤ α. Proof: Without loss of generality, we assume that node v is on top of the line crossing u and t. Let 2xuy and 2avb be the sectors of the forwarding region defined by node u and v respectively for destination node t. To prove the lemma, it is equivalent to show that the intersected region by 2avb with disk D(u,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Wireless Communications and Mobile Computing

سال: 2018

ISSN: 1530-8669,1530-8677

DOI: 10.1155/2018/7985756