English
Related papers

Related papers: Secure Communication in Dynamic Wireless Ad hoc Ne…

200 papers

In a wireless network the set of transmitting nodes changes frequently because of the MAC scheduler and the traffic load. Previously, connectivity in wireless networks was analyzed using static geometric graphs, and as we show leads to an…

Information Theory · Computer Science 2015-03-13 RadhaKrishna Ganti , Martin Haenggi

An ad hoc network is a self-organizing network with help of Access Point (AP) of wireless links connecting nodes to another. The nodes can communicate without infrastructure network. They form an random topology (BSS/ESS), where the nodes…

Cryptography and Security · Computer Science 2013-07-17 K. Karnavel , A. Baladhandayutham

Secured communication in ad hoc wireless networks is primarily important, because the communication signals are openly available as they propagate through air and are more susceptible to attacks ranging from passive eavesdropping to active…

Networking and Internet Architecture · Computer Science 2010-07-15 S. Sumathy , B. Upendra Kumar

Information theoretic secrecy is combined with cryptographic secrecy to create a secret-key exchange protocol for wireless networks. A network of transmitters, which already have cryptographically secured channels between them, cooperate to…

Cryptography and Security · Computer Science 2016-11-15 Toni Draganov Stojanovski , Ninoslav Marina

This work studies the achievable secure rate per source-destination pair in wireless networks. First, a path loss model is considered, where the legitimate and eavesdropper nodes are assumed to be placed according to Poisson point processes…

Information Theory · Computer Science 2010-04-13 O. Ozan Koyluoglu , C. Emre Koksal , Hesham El Gamal

Information-theoretic security -- widely accepted as the strictest notion of security -- relies on channel coding techniques that exploit the inherent randomness of the propagation channels to significantly strengthen the security of…

Information Theory · Computer Science 2010-01-22 Pedro C. Pinto , Joao Barros , Moe Z. Win

This paper considers the transmission of confidential messages over noisy wireless ad hoc networks, where both background noise and interference from concurrent transmitters affect the received signals. For the random networks where the…

Information Theory · Computer Science 2014-01-24 Jinxiao Zhu , Yin Chen , Yulong Shen , Osamu Takahashi , Xiaohong Jiang , Norio Shiratori

We investigate large wireless networks subject to security constraints. In contrast to point-to-point, interference-limited communications considered in prior works, we propose active cooperative relaying based schemes. We consider a…

Information Theory · Computer Science 2015-03-03 Mahtab Mirmohseni , Panagiotis Papadimitratos

This paper studies physical layer security in a wireless ad hoc network with numerous legitimate transmitter-receiver pairs and eavesdroppers. A hybrid full-/half-duplex receiver deployment strategy is proposed to secure legitimate…

Information Theory · Computer Science 2017-03-28 Tong-Xing Zheng , Hui-Ming Wang , Jinhong Yuan , Zhu Han , Moon Ho Lee

Connectivity of wireless sensor networks (WSNs) is a fundamental global property expected to be maintained even though some sensor nodes are at fault. In this paper, we investigate the connectivity of random geometric graphs (RGGs) in the…

Information Theory · Computer Science 2018-04-23 Satoshi Takabe , Tadashi Wadayama

Traditionally, wireless network protocols have been designed for performance. Subsequently, as attacks have been identified, patches have been developed. This has resulted in an "arms race" development process of discovering vulnerabilities…

Networking and Internet Architecture · Computer Science 2013-09-12 Jonathan Ponniah , Yih-Chun Hu , P. R. Kumar

We propose a routing protocol for wireless networks. Wireless routing protocols allow hosts within a network to have some knowledge of the topology in order to know when to forward a packet (via broadcast) and when to drop it. Since a…

Cryptography and Security · Computer Science 2009-07-24 Amitabh Saxena

In this paper, we study the problem of secure routing in a multihop wireless ad-hoc network in the presence of randomly distributed eavesdroppers. Specifically, the locations of the eavesdroppers are modeled as a homogeneous Poisson point…

Information Theory · Computer Science 2016-11-17 Jianping Yao , Suili Feng , Xiangyun Zhou , Yuan Liu

In wireless ad hoc networks, distributed nodes can collaboratively form an antenna array for long-distance communications to achieve high energy efficiency. In recent work, Ochiai, et al., have shown that such collaborative beamforming can…

Information Theory · Computer Science 2007-07-13 Athina P. Petropulu , Lun Dong , H. Vincent Poor

We study the problem of power-efficient routing for multihop wireless ad hoc sensor networks. The guiding insight of our work is that unlike an ad hoc wireless network, a wireless ad hoc sensor network does not require full connectivity…

Networking and Internet Architecture · Computer Science 2008-07-18 Amitabha Bagchi

Over the recent years, the proliferation of smart devices and their applications has led to a rapid evolution of the concept of the Internet of Things (IoT), advancing large scale machine type networks which are characterized by sporadic…

Signal Processing · Electrical Eng. & Systems 2019-03-27 Eleni Demarchou , Constantinos Psomas , Ioannis Krikidis

Ad hoc networks are the special networks formed for specific applications. Operating in ad-hoc mode allows all wireless devices within range of each other to discover and communicate in a peer-to-peer fashion without involving central…

Networking and Internet Architecture · Computer Science 2014-05-22 Shikha Jain

The ability to exchange secret information is critical to many commercial, governmental, and military networks. The intrinsically secure communications graph (iS-graph) is a random graph which describes the connections that can be securely…

Information Theory · Computer Science 2010-08-26 Pedro C. Pinto , Moe Z. Win

The ability to exchange secret information is critical to many commercial, governmental, and military networks. The intrinsically secure communications graph (iS-graph) is a random graph which describes the connections that can be securely…

Information Theory · Computer Science 2016-11-17 Pedro C. Pinto , Joao Barros , Moe Z. Win

We consider a continuum percolation model consisting of two types of nodes, namely legitimate and eavesdropper nodes, distributed according to independent Poisson point processes (PPPs) in $\bbR ^2$ of intensities $\lambda$ and $\lambda_E$…

Information Theory · Computer Science 2013-08-15 Rahul Vaze , Srikanth Iyer
‹ Prev 1 2 3 10 Next ›