中文
相关论文

相关论文: On Optimal Neighbor Discovery

200 篇论文

We investigate the condition on transmission radius needed to achieve connectivity in duty-cycled wireless sensor networks (briefly, DC-WSN). First, we settle a conjecture of Das et. al. (2012) and prove that the connectivity condition on…

网络与互联网体系结构 · 计算机科学 2015-09-30 Amitabha Bagchi , Cristina Pinotti , Sainyam Galhotra , Tarun Mangla

Energy management is a crucial challenge in wireless sensor networks. To date, many techniques have been proposed to reduce energy consumption. Duty cycle methods reduce the energy consumption of wireless sensor networks since energy…

网络与互联网体系结构 · 计算机科学 2022-02-22 Mahta Moezzi , Parsa Emamdadi

Modern wireless machine-to-machine-type communications aim to provide both ultra reliability and low latency, stringent requirements that appear to be mutually exclusive. From the noisy channel coding theorem, we know that reliable…

信息论 · 计算机科学 2020-12-04 Diego Barragán Guerrero , Minh Au , Ghyslain Gagnon , François Gagnon , Pascal Giard

In this paper, we present an overview of Nearest neighbor (NN) methods, which are frequently employed for solving classification problems using supervised learning. The article concisely introduces the theoretical background, algorithmic,…

网络与互联网体系结构 · 计算机科学 2021-07-19 Syed Ali Raza Zaidi

The discovery of neighbouring active nodes is one of the most challenging problems in asynchronous ad hoc networks. Since time synchronization is extremely costly in these networks, application of asynchronous methods like quorum-based…

网络与互联网体系结构 · 计算机科学 2020-07-09 Mehdi Imani , Maaruf Ali , Hamid Reza Arabnia

In this paper a convergent, nearest-neighbor, control protocol is suggested for agents with nontrivial dynamics. The protocol guarantees convergence to a common point in space even if each agent is restricted to communicate with a single…

机器人学 · 计算机科学 2016-07-05 Ahmad A. Masoud

Sensor networks are ubiquitously used for detection and tracking and as a result covering is one of the main tasks of such networks. We study the problem of maximizing the coverage lifetime of a barrier by mobile sensors with limited…

数据结构与算法 · 计算机科学 2013-04-24 Amotz Bar-Noy , Dror Rawitz , Peter Terlecky

We consider the model of communication where wireless devices can either switch their radios off to save energy, or switch their radios on and engage in communication. We distill a clean theoretical formulation of this problem of minimizing…

数据结构与算法 · 计算机科学 2012-02-15 Milan Bradonjic , Eddie Kohler , Rafail Ostrovsky

Traditional Neighbor Discovery (ND) and Secure Neighbor Discovery (SND) are key elements for network functionality. SND is a hard problem, satisfying not only typical security properties (authentication, integrity) but also verification of…

密码学与安全 · 计算机科学 2025-07-09 Ahmed Mohamed Hussain , Panos Papadimitratos

Many interactions between network users rely on trust, which is becoming particularly important given the security breaches in the Internet today. These problems are further exacerbated by the dynamics in wireless mobile networks. In this…

网络与互联网体系结构 · 计算机科学 2010-04-27 Udayan Kumar , Gautam Thakur , Ahmed Helmy

Wireless Sensor Networks are basically used for gathering information needed by smart environments but they are particularly useful in unattended situations where terrain, climate and other environmental constraints may hinder in the…

网络与互联网体系结构 · 计算机科学 2010-05-24 Sami Halawani , Abdul Waheed Khan

Mobile Ad hoc Network (MANET), supporting Machine-Type Communication(MTC), has a strong demand for rapid networking. Neighbor Discovery (ND) is a key initial step in configuring MANETs and faces a serious challenge in decreasing convergence…

系统与控制 · 电气工程与系统科学 2023-10-12 Zhiqing Wei , Chenfei Li , Yanpeng Cui , Xu Chen , Zeyang Meng , Zhiyong Feng

Improved mobile device battery lifetime and latency mini-mization are critical requirements for enhancing the mobile broadband services and user experience. Long-term evolution (LTE) networks have adopted discontinuous reception (DRX) as…

信息论 · 计算机科学 2020-01-06 Soheil Rostami , Kari Heiska , Oleksandr Puchko , Kari Leppanen , Mikko Valkama

We investigate optimal resource allocation for delay-limited cooperative communication in time varying wireless networks. Motivated by real-time applications that have stringent delay constraints, we develop a dynamic cooperation strategy…

信息论 · 计算机科学 2009-10-08 Rahul Urgaonkar , Michael J. Neely

An important first step when deploying a wireless ad hoc network is neighbor discovery in which every node attempts to determine the set of nodes it can communicate with in one wireless hop. In the recent years, cognitive radio (CR)…

分布式、并行与集群计算 · 计算机科学 2017-01-09 Yanyan Zeng , K. Alex Mills , Shreyas Gokhale , Neeraj Mittal , S. Venkatesan , R. Chandrasekaran

The increasing wireless communication capabilities of vehicles creates opportunities for more efficient intersection management strategies. One promising approach is the replacement of traffic lights with a system wherein vehicles run…

分布式、并行与集群计算 · 计算机科学 2024-08-20 Kaya Alpturer , Joseph Y. Halpern , Ron van der Meyden

With the rapidly increasing number of deployed LTE femtocell base stations (FBS), energy consumption of femtocell networks has become a serious environmental issue. Therefore, energy-efficient protocols are needed to balance the trade-off…

网络与互联网体系结构 · 计算机科学 2015-08-07 Ying Wang , Xiangming Dai , Jason Min Wang , Brahim Bensaou

This paper considers N mobile nodes that move together in the vicinity of each other, whose initial poses as well as subsequent movements must be accurately tracked in real time with the assist of M(>=3) reference nodes. By engaging the…

分布式、并行与集群计算 · 计算机科学 2011-08-04 Xingkai Bao , Jing Li

Low probability of detection (LPD) communication has recently emerged as a new transmission technology to address privacy and security in wireless networks. Recent studies have established the fundamental limits of LPD communication in…

信息论 · 计算机科学 2019-06-21 Shihao Yan , Xiangyun Zhou , Jinsong Hu , Stephen V. Hanly

\emph{Contention Resolution} is a fundamental symmetry-breaking problem in which $n$ devices must acquire temporary and exclusive access to some \emph{shared resource}, without the assistance of a mediating authority. For example, the $n$…

数据结构与算法 · 计算机科学 2024-07-15 Dingyu Wang