Results 1 - 10 of 92

Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges

by Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Lingas, Martin Wahlen , 2008
"... We study here deterministic broadcasting in geometric radio networks (GRN) whose nodes have complete knowledge of the network. Nodes of a GRN are deployed in the Euclidean plane (R 2) and each of them can transmit within some range r assigned to it. We adopt model in which ranges of nodes are nonun ..."
Abstract - Cited by 4 (2 self) - Add to MetaCart
We study here deterministic broadcasting in geometric radio networks (GRN) whose nodes have complete knowledge of the network. Nodes of a GRN are deployed in the Euclidean plane (R 2) and each of them can transmit within some range r assigned to it. We adopt model in which ranges of nodes

Routing and Broadcasting in Ad-Hoc Networks

by Der Philosophisch-naturwissenschaftlichen Fakultät, Der Universität Bern, Marc Heissenbüttel, Prof Dr, T. Braun, Der Philosophisch-naturwissenschaftlichen Fakultät, Der Universität Bern, Marc Heissenbüttel, Von Frutigen, Prof Dr, T. Braun
"... I would like to thank Prof. Dr. Torsten Braun, head of the Computer Network and Distributed Systems group (RVS), for supervising this work and for his insightful advises. Prof. Dr. Torsten Braun encouraged and motivated me to publish my research results and he provided me the opportunity to present ..."
Abstract - Add to MetaCart
I would like to thank Prof. Dr. Torsten Braun, head of the Computer Network and Distributed Systems group (RVS), for supervising this work and for his insightful advises. Prof. Dr. Torsten Braun encouraged and motivated me to publish my research results and he provided me the opportunity to present

Maximizing the Number of Broadcast Operations in Random Geometric Ad-Hoc Wireless Networks ∗

by Tiziana Calamoneri, Andrea E. F. Clementi, Emanuele G. Fusco, Riccardo Silvestri , 2009
"... We consider static ad-hoc wireless networks whose nodes, equipped with the same initial battery charge, may dynamically change their transmission range. When a node v transmits with range r(v), its battery charge is decreased by β r(v) 2 where β> 0 is a fixed constant. The goal is to provide a ra ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
n is the number of nodes of the network. We consider random geometric instances formed by selecting n points independently and uniformly at random from a square of side length n in the Euclidean plane. We present an efficient algorithm that constructs a range assignment schedule having length

Maximizing the number of broadcast operations in static random geometric ad-hoc networks

by Tiziana Calamoneri, Andrea Clementi, Emanuele G. Fusco, Università Tor, Vergata Roma - In Proc. of OPODIS, LNCS , 2007
"... Abstract. We consider static ad-hoc wireless networks where nodes have the same initial battery charge and they may dynamically change their transmission range at every time slot. When a node v transmits with range r(v), its battery charge is decreased by β × r(v) 2 where β> 0 is a fixed constant ..."
Abstract - Cited by 1 (1 self) - Add to MetaCart
-case approximation ratio Θ(log n), where n is the number of nodes of the network [5]. We consider random geometric instances formed by selecting n points independently and uniformly at random from a square of side length √ n in the Euclidean plane. We first present an efficient algorithm that constructs a range

Using Adaptive Range Control to Optimize 1 Hop Broadcast Coverage in Dense Wireless Networks

by Xiaoyan Li, Thu D. Nguyen, Richard P. Martin , 2003
"... We present a simple distributed algorithm for maximizing 1 hop broadcast coverage in dense ad-hoc wireless networks, which is important because broad classes of routing, localization, and discovery protocols rely on periodic broadcasts. Our strategy for maximizing coverage is based on spatial reuse, ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
broadcast adjustment rounds and provides ranges accurate to within 20 % of optimal across a wide variety of rates and densities for uniform networks. Using measured position data from our laboratory, we also show that our algorithm quickly converges and provides good coverage for highly non-uniform networks

Efficient Multicast in Hybrid Wireless Networks

by unknown authors
"... Abstract—The increasing popularity of smartphones and other similar multi-modal wireless devices has created an opportunity for the realization of large-scale hybrid (or heterogeneous) networks. Typically, modern mobile devices are likely to support a short range communication interface (e.g. IEEE 8 ..."
Abstract - Add to MetaCart
and file sharing, and “voice call groups ” in disaster relief and military hybrid networks. In this paper, the problem of resource-efficient multicast in hybrid wireless networks which include both point-to-point (cellular) and broadcast (MANET) links is considered. The underlying optimization problem is a

Efficient Multicast in Hybrid Wireless Networks

by unknown authors
"... Abstract—The increasing popularity of smartphones and other similar multi-modal wireless devices has created an opportunity for the realization of large-scale hybrid (or heterogeneous) networks. Typically, modern mobile devices are likely to support a short range communication interface (e.g. IEEE 8 ..."
Abstract - Add to MetaCart
and file sharing, and “voice call groups ” in disaster relief and military hybrid networks. In this paper, the problem of resource-efficient multicast in hybrid wireless networks which include both point-to-point (cellular) and broadcast (MANET) links is considered. The underlying op-timization problem

Redi J “Effect of Overhearing Transmissions on Energy Efficiency

by Prithwish Basu, Jason Redi - in Dense Sensor Networks” IPSN , 2004
"... Energy eciency is an important design criterion for the development of sensor networking protocols involving data dissemination and gathering. In-network processing of sen-sor data, aggregation, transmission power control in radios, and periodic cycling of node wake-up schedules are some techniques ..."
Abstract - Cited by 17 (0 self) - Add to MetaCart
energy cost and that computing the minimum spanning tree on the augmented cost metric results in energy savings, es-pecially in networks with non-uniform spatial node distribu-tion. We also study the impact of this new metric on the well known energy-ecient dissemination (also called broadcast-ing

Efficient Intelligent Localization Scheme for Distributed Wireless Sensor Networks

by Chunlai Chai
"... Abstract—To estimate location accurately in distributed wireless sensor networks (WSNs), an efficient intelligent position estimation scheme is proposed which needs fewer known nodes without calculating relative positions. The proposed intelligent localization scheme includes two phases. In the firs ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
that, the proposed scheme can decrease the average position error down to 9 % radio range, and increase the average number of located nodes up to 78 % when connectivity is greater than 12 in 20 % known node ratio. Index Terms—intelligent localization, wireless sensor networks, distributed algorithm I.

Magnet: Robust and Efficient Collection through Control and Data Plane Integration

by unknown authors
"... Despite being a core networking primitive, collection protocols today often suffer from poor reliability (e.g., 70%) in practice, and heavily used protocols have never been evaluated in terms of communication efficiency. Using detailed experimental studies, we describe three challenges that cause ex ..."
Abstract - Add to MetaCart
Despite being a core networking primitive, collection protocols today often suffer from poor reliability (e.g., 70%) in practice, and heavily used protocols have never been evaluated in terms of communication efficiency. Using detailed experimental studies, we describe three challenges that cause
Results 1 - 10 of 92