ASYMPTOTIC DISTRIBUTION OF THE NUMBER OF ISOLATED NODES IN WIRELESS AD HOC NETWORKS WITH UNRELIABLE NODES AND LINKS

2010 ◽  
Vol 02 (01) ◽  
pp. 107-124 ◽  
Author(s):  
CHIH-WEI YI ◽  
PENG-JUN WAN ◽  
CHAO-MIN SU ◽  
KUO-WEI LIN ◽  
SCOTT C.-H. HUANG
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Unit Area ◽  
Wireless Ad Hoc Network ◽  
Key Predistribution ◽  
Key Predistribution Schemes ◽  
Hoc Networks ◽  
Maximum Transmission

In this paper, we study the connectivity of wireless ad hoc networks that are composed of unreliable nodes and links by investigating the distribution of the number of isolated nodes. We assume that a wireless ad hoc network consists of n nodes distributed independently and uniformly in a unit-area disk or square. All nodes have the same maximum transmission radius rn, and two nodes have a link if their distance is at most rn. Nodes are active independently with probability 0 < p1 ≤ 1, and links are up independently with probability 0 < p2 ≤ 1. Nodes are said isolated if they do not have any links to active nodes. We show that if [Formula: see text] for some constant ξ, then the total number of isolated nodes (or isolated active nodes, respectively) is asymptotically Poisson with mean e-ξ (or p1e-ξ, respectively). In addition, in the secure wireless networks that adopt m-composite key predistribution schemes, a node is said isolated if it does not have a secure link. Let p denote the probability of the event that two neighbor nodes have a secure link. If all nodes have the same maximum transmission radius [Formula: see text], the total number of isolated nodes is asymptotically Poisson with mean e-ξ.

Cross-Layered Secure and QoS Aware Design of VOIP over Wireless Ad-Hoc Networks

2013 ◽  
Vol 9 (4) ◽  
pp. 23-45 ◽  
Author(s):  
Shahin Vakilinia ◽  
Mohammadhossein Alvandi ◽  
Mohammadreza Khalili Shoja ◽  
Iman Vakilinia
Keyword(s):  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Denial Of Service ◽  
Cross Layer ◽  
Wireless Ad Hoc Network ◽  
Cross Layer Design ◽  
Hoc Networks

In this paper, Cross-layer design has been used to provide quality of service (QoS) and security at the same time for VOIP over the wireless ad-hoc network. In this paper the authors extend their previous work (i.e. Multi-path Multi-Channel Protocol Design for Secure QoS-Aware VOIP in Wireless Ad-Hoc Networks) by adding transport and application layers considerations. The goal of this paper is to support QoS and security of VOIP simultaneously. Simulation results shows that the proposed cross-layered protocol stack design significantly improve QoS parameters of the VOIP calls under the jamming or Denial-of-service attacks.

Study of Ad hoc Networks with Reference to MANET, VANET, FANET

2017 ◽  
Vol 7 (7) ◽  
pp. 390 ◽  
Author(s):  
Bodhy Krishna .S
Keyword(s):  
Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Vehicular Ad Hoc Networks ◽  
Ad Hoc ◽  
Mobile Network ◽  
Wireless Ad Hoc Network ◽  
Mobile Ad Hoc ◽  
Autonomous Nodes ◽  
Hoc Networks ◽  
Network Administration

A wireless ad hoc network is a decentralized type of wireless network. It is a type of temporary computer-to-computer connection. It is a spontaneous network which includes mobile ad-hoc networks (MANET), vehicular ad-hoc networks (VANET) and Flying ad-hoc networks (FANET). A MANET is a network that has many free or autonomous nodes often composed of mobile devices that can operate without strict top-down network administration [1]. A VANET is a sub form of MANET. It is a technology that uses vehicles as nodes in a network to create a mobile network. FANET is an ad-hoc network of flying nodes. They can fly independently or can be operated distantly. This paper discusses the characteristics of these three ad-hoc networks.

scholarly journals A Study of Attack on Wireless Ad-Hoc Network

2019 ◽  
pp. 168-174 ◽  
Author(s):  
Pawitar Dulari
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Wireless Ad Hoc Network ◽  
Essential Requirement ◽  
Mobile Ad Hoc ◽  
Hoc Networks ◽  
Random Nature

Security is an essential requirement in wireless ad hoc network. The type of ad hoc networks makes them vulnerable to distinct forms of attack. The random nature of these networks makes invoke of security a challenging issue. The paper shows the main vulnerabilities in the mobile ad hoc networks, which have made it much easier to suffer from attacks. Then it presents the main attack categories that exist in it. Finally presents the current security solutions for the mobile ad hoc network.

Game Theory for Wireless Ad Hoc Networks

2014 ◽  
pp. 130-145
Keyword(s):  
Wireless Networks ◽  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Wired Networks ◽  
Mode Of Operation ◽  
Ieee 802.11 Wireless Networks ◽  
Hoc Networks ◽  
Network Device

An ad hoc network typically refers to any set of networks where all devices have equal status on a network and are free to associate with any other ad hoc network device in link range. In particular, ad hoc network often refers to a mode of operation of IEEE 802.11 wireless networks. A wireless ad hoc network is a decentralized type of wireless network. The network is ad hoc because it does not rely on a pre-existing infrastructure, such as routers in wired networks or access points in managed (infrastructure) wireless networks. The decentralized nature of wireless ad hoc networks makes them suitable for a variety of applications where central nodes cannot be relied on and may improve the scalability of networks compared to wireless managed networks, though theoretical and practical limits to the overall capacity of such networks have been identified. This chapter explores this.

Game Theory for Wireless Ad Hoc Networks

Game Theory ◽  
2017 ◽  
pp. 353-368
Author(s):  
Sungwook Kim
Keyword(s):  
Wireless Networks ◽  
Ad Hoc Networks ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Wired Networks ◽  
Mode Of Operation ◽  
Ieee 802.11 Wireless Networks ◽  
Hoc Networks ◽  
Network Device

An ad hoc network typically refers to any set of networks where all devices have equal status on a network and are free to associate with any other ad hoc network device in link range. In particular, ad hoc network often refers to a mode of operation of IEEE 802.11 wireless networks. A wireless ad hoc network is a decentralized type of wireless network. The network is ad hoc because it does not rely on a pre-existing infrastructure, such as routers in wired networks or access points in managed (infrastructure) wireless networks. The decentralized nature of wireless ad hoc networks makes them suitable for a variety of applications where central nodes cannot be relied on and may improve the scalability of networks compared to wireless managed networks, though theoretical and practical limits to the overall capacity of such networks have been identified. This chapter explores this.

scholarly journals Low-Computational Extended Orthogonal Matched Filter Structure for Multiuser Detection

Telecom ◽  
2020 ◽  
Vol 1 (1) ◽  
pp. 32-47
Author(s):  
Kento Takabayashi ◽  
Shuhei Harada ◽  
Takumi Kobayashi ◽  
Katsumi Sakakibara ◽  
Ryuji Kohno
Keyword(s):  
Computational Complexity ◽  
Multiuser Detection ◽  
Wireless Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Matched Filter ◽  
Wireless Ad Hoc Network ◽  
Bit Error Ratio ◽  
Hoc Networks ◽  
Code Division Multiple

This research provides a novel extended orthogonal matched filter (EOMF) structure that supports multiuser detection. In addition, this structure is designed to suppress increases in computational complexity and circuit scale. In coming years, the number of Internet of Things (IoT) applications that use wireless ad hoc networks is expected to increase. To realize a highly reliable wireless ad hoc network, it is essential to introduce a method for cancelling the interference from other users. This research adopts a method based on code division multiple access (CDMA). However, a CDMA-based method has difficulty with deteriorating performance due to the near-far problem and the increase in the amount of interference as the number of users increases. Another problem is that the spreading sequence of each user is unknown in a wireless ad hoc network. The EOMF effectively removes interference while solving the above problems by combining an OMF and an adaptive array antenna. In this research, an EOMF structure with multiuser detection and lower computational complexity than the conventional EOMF is proposed. By the derived formulas and numerical examples, the proposed structure reduces the computational complexity by approximately 75% compared to the conventional EOMF and obtains sufficient bit error ratio (BER) performance.

scholarly journals Paris Attack in Wireless Ad Hoc Network

2011 ◽  
Vol 1 (1) ◽  
Author(s):  
Mohit Jain ◽  
VISHNU K
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Wireless Ad Hoc Network ◽  
Aodv Protocol ◽  
Man In The Middle ◽  
Mobile Ad Hoc ◽  
Hoc Networks

Mobile Ad hoc networks are often used in places with little or no infrastructure. However its very nature of being dynamic and infrastructure less makes it vulnerable to many of the security related issues. In this paper we make use of the vulnerability present in the AODV protocol to present a new kind of Man in the Middle attack for MANETs namely, “The Paris Attack”.

scholarly journals A novel implementation of backpressure algorithm in wireless ad hoc network

2017 ◽  
Vol 7 (1.2) ◽  
pp. 181
Author(s):  
Ugendhar Addagatla ◽  
V. Janaki
Keyword(s):  
Wireless Networks ◽  
Ad Hoc Networks ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Wireless Ad Hoc Network ◽  
Throughput Performance ◽  
Throughput Optimality ◽  
Hoc Networks ◽  
The One ◽  
Throughput And Delay

In the wireless networks, the routing technique is the one of the highest concern and it is the important procedure in the ad hoc networks. To aid this effort, we proposed a new valuation of backpressure appliances for wireless networks. By this proposed system, we will address numerous preparation and routing difficulties and also recover the throughput and delay that are essentially produced by the packets at the node transmission. The Backpressure routing is a dense and enlarged throughput for wireless networks, but endures improved delays. In routing, the backpressure algorithm is known to afford throughput optimality with active traffic. The significant supposition in the backpressure algorithm is that all nodes are kind and detect the algorithm rules leading the information conversation and principal optimization necessities. In the proposed system, we validate that how the node is steady at the backpressure algorithm routing and also by together easing the virtual trust line and the real package queue. The backpressure algorithm not only achieves flexibility, but also stands the throughput performance under safety attacks. This scheme is mostly enhances the node performance at the time of announcement and also it recovers the node security at the time of numerous threats in the wireless requests.

Sign in / Sign up

Export Citation Format

Share Document