A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Filters
Localized spanner construction for ad hoc networks with variable transmission range
2010
ACM transactions on sensor networks
Preserved Fulltext
This paper presents an algorithm for constructing a spanner for ad hoc networks whose nodes have variable transmission range. ...
Almost all previous spanner constructions for ad hoc networks assumed that all nodes in the network have the same transmission range. ...
Our spanner construction allows routing in adhoc networks with variable transmission radii. ...
doi:10.1145/1807048.1807054
fatcat:uaf3szyfovbtvehey6qporis2i
Localized Spanner Construction for Ad Hoc Networks with Variable Transmission Range
[chapter]
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 2013; you can also visit the original URL.
The file type is application/pdf.
This paper presents an algorithm for constructing a spanner for ad hoc networks whose nodes have variable transmission range. ...
Almost all previous spanner constructions for ad hoc networks assumed that all nodes in the network have the same transmission range. ...
Our spanner construction allows routing in adhoc networks with variable transmission radii. ...
doi:10.1007/978-3-540-85209-4_11
fatcat:fca6atlq2va65h2lb4jdbept2a
Evaluation of physical carrier sense based spanner construction and maintenance as well as broadcast and convergecast in ad hoc networks
2009
Ad hoc networks
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 2008; you can also visit the original URL.
The file type is application/pdf.
ad hoc networks. ...
Index Terms Ad hoc network, Backbone network, Broadcast, Physical carrier sensing, Resilience, Variable sensing ranges. Please direct correspondence to M. Reisslein. L. Ritchie, S. Deval, and M. ...
Our approach, which is developed for a more realistic network model with interference ranges larger than transmission ranges, is highly localized. ...
doi:10.1016/j.adhoc.2009.01.004
fatcat:udgrisuizjbe5d574k3urkwbyy
Routing and Traversal via Location Awareness in Ad Hoc Networks
[chapter]
2005
Handbook of Algorithms for Wireless Networking and 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 2008; you can also visit the original URL.
The file type is application/pdf.
algorithms for efficient traversal and route discovery in ad-hoc networks. ...
We survey some recent results that make use of location awareness of the hosts of an ad-hoc network in order to provide for efficient information dissemination. ...
Krizanc for his comments on a draft of the paper. ...
doi:10.1201/9781420035094.ch8
fatcat:ac62ijdzonfdvnghbvn6i46u2m
Localized topology control for unicast and broadcast in wireless ad hoc networks
2006
IEEE Transactions on Parallel and Distributed Systems
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 a novel localized topology control algorithm for each wireless node to locally select communication neighbors and adjust its transmission power accordingly, such that all nodes together self-form ...
Moreover, by assuming that the node ID and its position can be represented in O(log n) bits for a wireless network of n nodes, the total number of messages by our methods is in the range of [5n, 13n], ...
Unfortunately, none of the above structures can be formed and updated locally. RNG, which can be constructed locally, has been used for broadcasting in wireless ad hoc networks [29] . ...
doi:10.1109/tpds.2006.53
fatcat:2klyyw3dmjhrhfp754amo527ou
Fault tolerant deployment and topology control in wireless networks
2003
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing - MobiHoc '03
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.
This paper investigate fault tolerance for wireless ad hoc networks. We consider a large-scale of wireless networks whose nodes are distributed randomly in a unit-area square region. ...
We show that the constructed topology is also a length spanner. ...
ACKNOWLEDGEMENTS The authors would like to thank the anonymous reviewers for valuable comments for improving the paper. ...
doi:10.1145/778430.778431
fatcat:vhtp7lmxp5dqdkoduvelvqfyhe
Fault tolerant deployment and topology control in wireless networks
2003
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing - MobiHoc '03
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.
This paper investigate fault tolerance for wireless ad hoc networks. We consider a large-scale of wireless networks whose nodes are distributed randomly in a unit-area square region. ...
We show that the constructed topology is also a length spanner. ...
ACKNOWLEDGEMENTS The authors would like to thank the anonymous reviewers for valuable comments for improving the paper. ...
doi:10.1145/778415.778431
dblp:conf/mobihoc/LiWWY03
fatcat:w3hha7hwnbbahjlb6r2uzesymu
Fault tolerant deployment and topology control in wirelessad hoc networks
2004
Wireless Communications and 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.
This paper investigate fault tolerance for wireless ad hoc networks. We consider a large-scale of wireless networks whose nodes are distributed randomly in a unit-area square region. ...
We show that the constructed topology is also a length spanner. ...
ACKNOWLEDGEMENTS The authors would like to thank the anonymous reviewers for valuable comments for improving the paper. ...
doi:10.1002/wcm.161
fatcat:7eodzgshebbdvmtoyg4zmo3pqe
Constant density spanners for wireless ad-hoc networks
2005
Proceedings of the 17th annual ACM symposium on Parallelism in algorithms and architectures - SPAA'05
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.
An important problem for wireless ad hoc networks has been to design overlay networks that allow time-and energy-efficient routing. ...
range of any node and the backbone structure satisfies the properties of a topological spanner. ...
INTRODUCTION An important problem for wireless ad hoc networks has been to design overlay networks that allow time-and energy-efficient routing. ...
doi:10.1145/1073970.1073987
dblp:conf/spaa/KothapalliSOR05
fatcat:ydygnmdr7jak5nk7atydykfvna
Efficient Delaunay-based localized routing for wireless sensor networks
2007
International Journal of Communication Systems
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 2007; you can also visit the original URL.
The file type is application/pdf.
In this paper, we show that with high probability we can locally find a path for any pair of sensors such that the length of the path is no more than a constant factor of the minimum. ...
Consider a wireless sensor network consisting of n wireless sensors randomly distributed in a twodimensional plane. ...
Spanner and Spanning Ratio In an ad hoc sensor network, two far-apart nodes can communicate with each other through the relay of intermediate nodes; hence, each node only needs to set small transmission ...
doi:10.1002/dac.844
fatcat:zucfsj3i2rcirl7e573jkvvhcu
Interference-aware topology control for wireless sensor networks
2005
2005 Second Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, 2005. IEEE SECON 2005.
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 2007; you can also visit the original URL.
The file type is application/pdf.
Topology control has been well studied in wireless ad hoc networks. However, only a few topology control methods (e.g. [1]) take into account the low interference as a goal of the methods. ...
In this paper we present several algorithms to construct network topologies such that the maximum (or average) link (or nodal) interference of the topology is either minimized or approximately minimized ...
the spanning ratio [3] , [4] ; constructing planar spanner locally [3] . ...
doi:10.1109/sahcn.2005.1557081
dblp:conf/secon/LiMSW05
fatcat:27av2ghrjrgcxhlvye4edzr4xm
Near-Optimal Multicriteria Spanner Constructions in Wireless Ad Hoc Networks
2010
IEEE/ACM Transactions on Networking
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.
To the best of our knowledge, these are the first provable theoretical bounds for low cost spanners in wireless ad-hoc networks. ...
We consider a random wireless ad-hoc network with |V | = n nodes distributed uniformly and independently in a unit square. ...
ACKNOWLEDGEMENTS The authors would like to thank Liam Roditty and Yuri Rabinovich for enlightening discussions. ...
doi:10.1109/tnet.2010.2053381
fatcat:d436iuajordpjivpknlqwnprrq
Near Optimal Multicriteria Spanner Constructions in Wireless Ad-Hoc Networks
2009
IEEE INFOCOM 2009 - The 28th 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 2017; you can also visit the original URL.
The file type is application/pdf.
To the best of our knowledge, these are the first provable theoretical bounds for low cost spanners in wireless ad-hoc networks. ...
We consider a random wireless ad-hoc network with |V | = n nodes distributed uniformly and independently in a unit square. ...
ACKNOWLEDGEMENTS The authors would like to thank Liam Roditty and Yuri Rabinovich for enlightening discussions. ...
doi:10.1109/infcom.2009.5061918
dblp:conf/infocom/ShpunginS09
fatcat:fruhelo7qnculbkxr4fbr6cppa
Applications of k-local MST for topology control and broadcasting in wireless ad hoc networks
2004
IEEE Transactions on Parallel and Distributed Systems
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.
transmission range. ...
the node's transmission range. ...
Unfortunately, all these structures cannot be constructed locally. Thus, several locally constructed structures have been proposed for broadcasting in wireless ad hoc networks, such as RNG [13] . ...
doi:10.1109/tpds.2004.77
fatcat:52vwu4jxzvhj7ddz4sikvnn74i
Efficient localized routing for wireless ad hoc networks
2003
23rd International Conference on Distributed Computing Systems Workshops, 2003. Proceedings.
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 2004; you can also visit the original URL.
The file type is application/pdf.
We consider a wireless ad hoc network consisting of Ò points randomly distributed in a two-dimensional plane. ...
We show that, with high probability, we can locally find a path for any pair of nodes such that the length of the path is no more than a constant factor of the minimum. ...
In other words, the required transmission range so that local Delaunay triangulation equals the Delaunay triangulation is just twice of the minimum transmission range to have a connected network with high ...
doi:10.1109/icdcsw.2003.1203633
dblp:conf/icdcsw/LiW03
fatcat:6qppmx33rneexm7bxvl7ubzopm
« Previous
Showing results 1 — 15 out of 230 results