A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
A Distributed Protocol for the Bounded-Hops Converge-Cast in Ad-Hoc Networks
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
Euclidean space and a root b ∈ S, the h-hops Convergecast problem asks to find for a minimal energy-cost range assignment which allows to perform the converge-cast primitive (i.e. node accumulation) towards ...
In particular, we introduce an efficient parameterized randomized protocol for h-hops Convergecast and we analyze it on random instances created by placing n points uniformly at random in a d-cube of side ...
Distributed Protocol for the Ad-Hoc Model We consider h-hops Convergecast on the ad-hoc model and we propose a distributed randomized protocol h-Prot that, given a set S and a root b, constructs a feasible ...
doi:10.1007/11814764_7
fatcat:33nywpy4lfhzza2tbuido65fmy
Validation of Wireless Sensor Networks with Cross-Layer Properties
2013
International Journal of Computer Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This framework is generic and can be parameterized for a wide variety of MAC protocols and routing protocols. ...
In the original OSI networking model, data are kept strictly within a given layer because strict boundaries between layers are enforced. ...
The authors would like to thank the Vardhaman college of engineering for its support with their excellent lab facilities. ...
doi:10.5120/13529-1276
fatcat:xwrxeltshzfcxgd3itcfgsmk5y
Converge Cast: On the Capacity and Delay Tradeoffs
2012
IEEE Transactions on Mobile Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we define an ad hoc network where multiple sources transmit packets to one destination as Converge-Cast network. ...
Then node mobility is introduced to increase network capacity, for which our study is performed in two steps. The first step is to establish the delay in single-session transmission. ...
ACKNOWLEDGMENT We deeply appreciate the valuable and constructive comments from the anonymous reviewers, and editor. ...
doi:10.1109/tmc.2011.110
fatcat:sffdi7x4mfcohf2xmw6rjfkv3m
Fundamental Limits of Information Dissemination in Wireless Ad Hoc Networks
2011
IEEE Transactions on Wireless Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show that Θ ( ( ) √ / ), Θ (1/ ), and Θ ( 2 ( ) ) bits per second constitute a tight bound for the throughput capacity of random wireless ad hoc networks under the protocol model when = ( −2 ( ) ) , ...
We show that the use of MPR can lead to both increased network capacity and reduced delays in wireless ad hoc networks. ...
"
Transmitters Receivers ( ) = ( ) = Ω ( √ (log )/ ) . (1) We assume a random wireless ad hoc network with nodes distributed uniformly in the network where the area of the network is a square of unit ...
doi:10.1109/twc.2011.011211.100007
fatcat:ffyen3zt5ndhxeqauuf5mtuptm
Self-stabilizing multicast protocols for ad hoc networks
2003
Journal of Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We propose two distributed algorithms to maintain respectively the minimum weight spanning tree (MST) based multi-cast tree and the shortest path (SPST) multi-cast tree in a given ad hoc network for a ...
In any ad hoc network, the participating nodes periodically transmit beacon messages for message transmission as well as to maintain the knowledge of the local topology at the node; as a result the nodes ...
The authors wish to thank the anonymous reviewers for many helpful comments that improved the presentation of the paper. ...
doi:10.1016/s0743-7315(02)00029-1
fatcat:xpf7lc2yovaczn5yg64nxjyh6y
Capacity scaling laws of information dissemination modalities in wireless ad hoc networks
2008
2008 46th Annual Allerton Conference on Communication, Control, and Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We show that Θ (T (n) √ m/k), Θ (1/k), and Θ T 2 (n) bits per second constitute a tight bound for the throughput capacity of random wireless ad hoc networks under the protocol model respectively. ...
Information dissemination modalities are modeled with an (n, m, k)-cast formulation, where n, m, and k denote the number of nodes in the network, the number of destinations for each communication group ...
NETWORK MODEL AND PRELIMINARIES We assume a random wireless ad hoc network with n nodes distributed uniformly in a network of unit square area. ...
doi:10.1109/allerton.2008.4797692
fatcat:3zivpifmifhfdnyrilkwll5k2y
Capacity-delay tradeoff for information dissemination modalities in wireless networks
2008
2008 IEEE International Symposium on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This paper presents the first comprehensive capacity-delay tradeoff study for random wireless ad hoc networks under all information dissemination modalities (unicast, multicast, broadcast, anycast) when ...
Our results demonstrate that for unicast, increasing capacity requires additional delay for SPR similar to the results in [1] while MPR incurs no penalty, i.e., we can increase capacity and decrease delay ...
Lower Bound To derive an achievable lower bound, we use a TDMA scheme for random dense wireless ad hoc networks similar to the approach used in [9] . ...
doi:10.1109/isit.2008.4595072
dblp:conf/isit/WangSG08
fatcat:ovexb6irdrhenb7r4maaau2iou
Progressive Decentralized TDMA Based MAC: Joint Optimization of Slot Allocation and Frame Lengths
2013
MILCOM 2013 - 2013 IEEE Military Communications Conference
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Besides, we provide upper bound on the convergence time of the algorithm for a single node, and for the whole network. ...
The TDMA based MAC scheduling is considered appropriate for many applications in which deterministic medium access schedule plays a crucial role. ...
For ad hoc networks, distributed versions of RAND (named DRAND) and MNF (named HUDSAP) are proposed in [6] and [10] , respectively. ...
doi:10.1109/milcom.2013.40
dblp:conf/milcom/ChaudharyS13
fatcat:62vrkiqo4feljd7ml3regkydzy
Study And Analysis Of A Routing In Vehicular Ad Hoc Networks
2016
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
It is the Integrated ad hoc network for Wireless LAN (WLAN) and Cellular Technology. ...
These characteristics can be achieved only by the special network technology that is Vehicular Ad Hoc Network(VANET). ...
These routing protocols,(AODV and DSR) are designed for the general purpose ad hoc networks for mobile nodes and they do not maintain the routes unless in necessary conditions. ...
doi:10.5281/zenodo.57986
fatcat:sdac5eq4vrd6ppem3tcubrmhjq
A Unifying Perspective on the Capacity of Wireless Ad Hoc Networks
2008
IEEE INFOCOM 2008 - The 27th Conference on Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
We compute upper and lower bounds for the (n, m, k)cast throughput capacity in random wireless networks. ...
We present the first unified modeling framework for the computation of the throughput capacity of random wireless ad hoc networks in which information is disseminated by means of unicast routing, multicast ...
ad hoc networks. ...
doi:10.1109/infocom.2008.51
dblp:conf/infocom/WangSG08
fatcat:o7bbzugfercttp4bjpge4vavfq
A Unifying Perspective on the Capacity of Wireless Ad Hoc Networks
2008
2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
We compute upper and lower bounds for the (n, m, k)cast throughput capacity in random wireless networks. ...
We present the first unified modeling framework for the computation of the throughput capacity of random wireless ad hoc networks in which information is disseminated by means of unicast routing, multicast ...
ad hoc networks. ...
doi:10.1109/infocom.2007.51
fatcat:4hjhdfxunvc37bcifryb3zl4xa
Spontaneous, Self-Sampling Quorum Systems for Ad Hoc Networks
2008
2008 International Symposium on Parallel and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
A hybrid ad-hoc network uses a combination of base stations and multi-hop data forwarding. ...
Ad hoc networks provide a dynamic infrastructure, such as the ones commonly used in sensor network applications, that can be quickly deployed in a geographic region of interest [2] for reasons such as ...
We analyzed the communication bounds for a commonly used multi-hop ad hoc network, where both client-to-nodes and nodes-to-client communication is carried out in a multi-hop fashion. ...
doi:10.1109/ispdc.2008.61
dblp:conf/ispdc/KonwarMS08
fatcat:3cgw3cbc5ngcbnhy2ulg3ggy5m
A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph
[chapter]
2003
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we propose a new self-stabilizing distributed algorithm for minimal domination protocol in an arbitrary network graph using the synchronous model; the proposed protocol is general in the ...
sense that it can stabilize with every possible minimal dominating set of the graph. ...
In this paper we propose a distributed algorithm to maintain a minimal dominating set in an arbitrary ad hoc network. ...
doi:10.1007/978-3-540-24604-6_3
fatcat:cookbegrgffo5cd233kjpxbhxm
Throughput Scaling of Wireless Networks With Random Connections
2010
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. ...
The following results are proven: 1) for a class of connection models with finite mean and variance, the throughput scaling is upper-bounded by ( 1 3 ) for single-hop schemes, and ( 1 2 ) for two-hop ( ...
Berry and the anonymous reviewers for their thoughtful comments which helped us improve the initial submitted version of this manuscript. ...
doi:10.1109/tit.2010.2051470
fatcat:dln2ycsxfvew7dlleijj3xrhda
Mobile Ad Hoc Networks: The DHT paradigm
2009
2009 IEEE International Conference on Pervasive Computing and Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Ad Hoc On-Demand Distance Vector Routing The Ad Hoc On-Demand Distance Vector (AODV) protocol [42] is a widely adopted reactive protocol for mobile ad hoc networks. ...
This is the largest class of routing protocols available in ad hoc networks, mainly composed by routing protocols for wired networks modified to cope with ad hoc environments. ...
doi:10.1109/percom.2009.4912808
dblp:conf/percom/Caleffi09
fatcat:nvozjrmghfg7ngoqlunun7rt4y
« Previous
Showing results 1 — 15 out of 1,009 results