Results 1 - 10 of 86

Mobility increases the capacity of ad-hoc wireless networks

by Matthias Grossglauser, David Tse - IEEE/ACM TRANSACTIONS ON NETWORKING , 2002
"... The capacity of ad-hoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an ad-hoc network where n nodes communicate in random source-destination pairs. These nodes are assumed to be mobile. We examine the per-session throughpu ..."
Abstract - Cited by 1220 (5 self) - Add to MetaCart
The capacity of ad-hoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an ad-hoc network where n nodes communicate in random source-destination pairs. These nodes are assumed to be mobile. We examine the per-session

Mobility Increases the Capacity of Ad Hoc Wireless Networks

by Matthias Grossglauser , David Tse , 2002
"... The capacity of ad hoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an ad hoc network where nodes communicate in random source–destination pairs. These nodes are assumed to be mobile. We examine the per-session throughput ..."
Abstract - Add to MetaCart
The capacity of ad hoc wireless networks is constrained by the mutual interference of concurrent transmissions between nodes. We study a model of an ad hoc network where nodes communicate in random source–destination pairs. These nodes are assumed to be mobile. We examine the per-session throughput

On the Capacity Improvement of Multicast Traffic with Network Coding

by Zheng Wang, Shirish Kar, Hamid R. Sadjadpour, J. J. Garcia-luna-aceves , 809
"... Abstract—In this paper, we study the contribution of network coding (NC) in improving the multicast capacity of random wireless ad hoc networks when nodes are endowed with multipacket transmission (MPT) and multi-packet reception (MPR) capabilities. We show that a per session throughput capacity of ..."
Abstract - Cited by 8 (3 self) - Add to MetaCart
Abstract—In this paper, we study the contribution of network coding (NC) in improving the multicast capacity of random wireless ad hoc networks when nodes are endowed with multipacket transmission (MPT) and multi-packet reception (MPR) capabilities. We show that a per session throughput capacity

On the Multicast Capacity of Wireless Ad Hoc Networks with Network Coding

by Zheng Wang, Shirish S. Kar, Hamid R. Sadjadpour, J. J. Garcia-luna-aceves
"... Abstract: In this paper, we study the contribution of network coding (NC) in improving the multicast capacity of random wireless ad hoc networks when nodes are endowed with multi-packet transmission (MPT) and multi-packet reception (MPR) capabilities. We show that a per session throughput capacity o ..."
Abstract - Cited by 1 (0 self) - Add to MetaCart
Abstract: In this paper, we study the contribution of network coding (NC) in improving the multicast capacity of random wireless ad hoc networks when nodes are endowed with multi-packet transmission (MPT) and multi-packet reception (MPR) capabilities. We show that a per session throughput capacity

DOS Attack Severity on Static and Mobile Adhoc Network

by Md. Anwar Hussain
"... Abstract:- A wireless ad-hoc network is a collection of autonomous nodes that communicate with each other by each node acting as router and maintaining connectivity in a decentralized manner. The network topology is dynamic because the connectivity among the nodes may vary with time due to node depa ..."
Abstract - Add to MetaCart
departure, new arrivals and the possibility of having mobilenodes. In this paper, weexplore the effect on per session throughput of an adhoc network consisting offixed, and mobile non-maliciousnodes, by mobile and fixed malicious nodes making black hole and wormhole attacks and its severity.To simulate

Multicast Throughput Order of Network Coding in Wireless Ad-hoc Networks

by Shirish Kar, Zheng Wang, Hamid R. Sadjadpour, J. J. Garcia-luna-aceves
"... Abstract—We study the contribution of network coding (NC) in improving the multicast capacity of random wireless ad hoc networks. We consider a network with n nodes distributed uniformly in a unit square, with each node acting as a source for independent information to be sent to a multicast group c ..."
Abstract - Cited by 7 (1 self) - Add to MetaCart
consisting of m randomly chosen destinations. We show that in the presence of NC, the per-session „ capacity « under the protocol 1 model has a tight bound of Θ √ when m = O( mnlog(n) n log(n)) and Θ ( 1 n) when m = Ω (). Furthermore, we consider the n log(n) physical model, and “ show ” that the per-session

Round-Robin Scheduling for Max-Min Fairness in Data Networks

by Ellen L. Hahne - IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 9. NO. 7. SEPTEMBER 1991 , 1991
"... This paper studies a simple strategy, proposed independently by Gallager [l] and Katevenis [2], for fairly allocating link capacity in a point-to-point packet network with virtual circuit routing. Each link offers its packet transmission slots to its user sessions by polling them in round-robin orde ..."
Abstract - Cited by 132 (0 self) - Add to MetaCart
-robin order. In addition, window flow control is used to prevent excessive packet queues at the network nodes. As the window size increases, the session throughput rates are shown to approach limits that are perfectly fair in the max-min sense. That is, the smallest session rate in the network is as large

1 Approximation Algorithms for Throughput Maximization in Wireless Networks with Delay Constraints

by Guanhong Pei, Student Member, Srinivasan Parthasarathy, Aravind Srinivasan, Anil Kumar, S. Vullikanti
"... Abstract—We study the problem of throughput maximization in multi-hop wireless networks with end-to-end delay constraints for each session. This problem has received much attention starting with the work of Grossglauser and Tse (2002), and it has been shown that there is a significant trade-off betw ..."
Abstract - Add to MetaCart
total throughput within a factor of O () log∆m of the maximum, so that the loglog∆m per-session (end-to-end) delay is O ( ( log∆m loglog∆m ∆(c))2) , where ∆m = maxc{∆(c)}; note that these bounds depend only on the delays, and not on the network size, and this is the first such result, to our knowledge.

IEEE TRANSACTIONS ON COMMUNICATIONS, ACCEPTED FOR PUBLICATION 1 Multicast Throughput Order of Network Coding in Wireless Ad-hoc Networks

by Shirish S. Kar, Zheng Wang, Hamid R. Sadjadpour, Senior Member
"... Abstract—We consider a network with n nodes distributed uniformly in a unit square. We show that, under the protocol model, when ns = Ω ( log(n) 1+α) out of the n nodes, each act as source of independent information for a multicast group consisting of m randomly chosen destinations, the per-session ..."
Abstract - Add to MetaCart
Abstract—We consider a network with n nodes distributed uniformly in a unit square. We show that, under the protocol model, when ns = Ω ( log(n) 1+α) out of the n nodes, each act as source of independent information for a multicast group consisting of m randomly chosen destinations, the per-session

Achievable multicast throughput for homogeneous wireless ad hoc networks

by Cheng Wang, Changjun Jiang, Shaojie Tang, Xiang-yang Li, Xianfei Tang - in Proc. IEEE WCNC , 2009
"... Abstract—We mainly study the achievable multicast throughput (AMT) for homogeneous wireless ad hoc networks under Gaussian Channel model. We focus on two typical random networks, i.e., random extended networks (REN) and random dense networks (RDN). In REN and RDN, n nodes are randomly distributed in ..."
Abstract - Cited by 3 (2 self) - Add to MetaCart
throughput by taking account of all possible values of ns and nd. As a special case of our results, we show that for 1 ns =Θ(n), the per-session AMT for RDN is Ω ( ) when nd = O ( n log n 1) and is Ω( n) when nd =Ω ( n log n
Results 1 - 10 of 86