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

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.

Author(s):  
Bodhy Krishna .S

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.


Author(s):  
Shahin Vakilinia ◽  
Mohammadhossein Alvandi ◽  
Mohammadreza Khalili Shoja ◽  
Iman Vakilinia

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.


Author(s):  
Pawitar Dulari

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.


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.


2018 ◽  
Vol 7 (1.9) ◽  
pp. 217
Author(s):  
Dr S.SivaNageswara Rao ◽  
Orchu Aruna ◽  
Dr K.Lakshminadh

Now a day, every one using mobile devices for communicating with others. The development of new technologies, like Internet of Things (IoT) needs coverage, connectivity, scalability and QoS. In ubiquity networks, the major issues are coverage, connectivity, scalability and QoS. To solve these limitations, integrating wireless networks with ad hoc networks. This paper provides detail survey on how ad hoc networks are integrated with Cellular Network, Wireless Mesh Networks and Wireless Sensor Networks. This integration may resolve the problems of coverage, connectivity, scalability and QoS.


Game Theory ◽  
2017 ◽  
pp. 353-368
Author(s):  
Sungwook Kim

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.


2013 ◽  
Vol 712-715 ◽  
pp. 1816-1819
Author(s):  
Li Ying Xie ◽  
Jin Xin Ruan

With the previous proposed G/G/1 model, this paper analyzed the throughput expression in an unsaturated 802.11e one-hop ad hoc network. The expression is validated and the throughput performance is discussed by the simulations. The throughput expression derived in this paper will provide a way to analyze the impact of major QoS specific features on the throughput and hence can improve the performance of the network.


2011 ◽  
Vol 1 (1) ◽  
Author(s):  
Mohit Jain ◽  
VISHNU K

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”.


Author(s):  
Krishan Kumar ◽  
Poonam

Wireless networking grows rapidly because of the human desires for mobility and for freedom from tethers, i.e., from physical connections to communication networks. Recent advances in wireless technology have equipped portable computers, such as notebook computers and personal digital assistants with wireless interfaces that allow networked communication even while a user is mobile. We will focus on a particular kind of wireless network: mobile ad hoc networks. A mobile ad hoc network is a self organizing and rapidly deployable network in which neither a wired backbone nor a centralized control exists. The network nodes communicate with one another over scarce wireless channels in a multi-hop fashion. The ad hoc network is adaptable to the highly dynamic topology resulted from the mobility of network nodes and the changing propagation conditions. Generally, protocols used at medium access and physical layers of ad hoc networks are similar to those used in infrastructure based wireless networks. It is a common practise in infrastructure based wireless networks to use pre-data exchange of control information to eliminate the hidden terminal" problem.


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

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-ξ.


Sign in / Sign up

Export Citation Format

Share Document