STRONG CONNECTIVITY IN SENSOR NETWORKS WITH GIVEN NUMBER OF DIRECTIONAL ANTENNAE OF BOUNDED ANGLE

Author:

DOBREV STEFAN1,KRANAKIS EVANGELOS2,KRIZANC DANNY3,OPATRNY JAROSLAV4,PONCE OSCAR MORALES2,STACHO LADISLAV5

Affiliation:

1. Institute of Mathematics, Slovak Academy of Sciences, Bratislava, Slovak Republic

2. School of Computer Science, Carleton University, Ottawa, Ontario, K1S 5B6, Canada

3. Department of Mathematics and Computer Science, Wesleyan University, Middletown CT 06459, USA

4. Department of Computer Science and Software Engineering, Concordia University, Montréal, Quebec, H3G 1M8, Canada

5. Department of Mathematics, Simon Fraser University, 8888 University Drive, Burnaby, British Columbia, V5A 1S6, Canada

Abstract

Traditional approaches to connectivity in sensor networks are based on the omnidirectional antenna model which relies on the assumption that the sensors send and receive in all directions. Current technologies make possible the utilization of sensors with directional antenna capabilities whereby the sensors send and/or receive along a sector of a predefined angle (or beam-width). Although several researchers in the scientific literature have investigated the impact of directional antennae on network throughput, energy consumption, as well as security very little is known concerning the effect of directional antennae on its connectivity. In this paper, we introduce for the first time a new sensor model with each sensor being able to transmit in any one of k directions, for some fixed k, and explore the algorithmic limits and potential of such a directional antenna model. More specifically, given a set of n sensors in the plane, we consider the problem of establishing a strongly connected ad hoc network from these sensors using directional antennae. In particular, we prove that given such set of sensors, each equipped with k, 1 ≤ k ≤ 5, directional antennae with any angle of transmission, these antennae can be oriented in such a way that the resulting communication structure is a strongly connected digraph spanning all n sensors. Moreover, the transmission range of the antennae is at most [Formula: see text] times the optimal range (a range necessary to establish a connected network on the same set of sensors using omnidirectional antennae). The algorithm which constructs this orientation runs in O(n) time provided a minimum spanning tree on the set of sensors is given. We show that our solution can be used to give a tradeoff on the range and angle when each sensor has one antenna. Further, we also prove that for two antennae it is NP-hard to decide whether such an orientation exists if both the transmission angle and range are small for each antennae.

Publisher

World Scientific Pub Co Pte Lt

Subject

Discrete Mathematics and Combinatorics

Cited by 11 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Placing Wireless Chargers with Multiple Antennas;IEEE Transactions on Mobile Computing;2024

2. Improved algorithms in directional wireless sensor networks;Journal of Combinatorial Optimization;2023-04-20

3. Improved Algorithms in Directional Wireless Sensor Networks;2022 IEEE Wireless Communications and Networking Conference (WCNC);2022-04-10

4. Bounded-Angle Minimum Spanning Trees;Algorithmica;2021-11-17

5. Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios;Discrete & Computational Geometry;2021-04-16

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3