issn number (online): 2454-9614 link aware opportunistic ... · abstract—mobile adhoc networks...
TRANSCRIPT
South Asian Journal of Engineering and Technology Vol.2, No.42 (2016) 8–13
8
ISSN Number (online): 2454-9614
Link Aware Opportunistic Relay Node Selection
Algorithm for QOD Routing Protocol Asha Krupa. N
1, Ramya Asha Latha. B
2, Venkaresh. T. S
3
Department of CSE, Narasaraopeta Engineering College, Narasaraopet, JNTUK, AP, India 1 [email protected] 2 [email protected]
Abstract—Mobile Adhoc Networks (MANET) is considered
as the most significant next generation wireless networks. QoS
routing is an important issue in the Mobile Adhoc Networks.
QoS routing is applied in wireless hybrid networks. The wireless
hybrid networks are designed from the base of Mobile Adhoc
networks and wireless infrastructure. In this paper, we propose
a novel QoS oriented distributed routing protocol (QOD) which
provides QoS services in the highly dynamic scenario. The links
between nodes are highly impulsive in the dynamic
environment. The routing process should be highly energetic, so
as to avoid the packet loss during transmission. To overcome
from this issue, we introduce Link aware Opportunistic relay
node selection algorithm. The unique feature in this algorithm is
the efficient maintenance of the nodes using routing table.
Relied upon the link residual span, the route path between
source and destination node is established. Experimental
designs will show the effectiveness of the proposed QoD routing
protocols.
I. INTRODUCTION
The advancements made in the Mobile Adhoc Networks
(MANET) are the hybrid wireless networks systems. The
hybrid wireless network systems is an augmentation to a base
system, where a versatile host may interface with an Access Point (AP) utilizing multi jump remote systems by means of
other versatile hosts [1]. The APs are designed to work on
one of numerous accessible channels. Versatile hosts and
remote switches can choose their working channels
powerfully through channel switching. Hybrid wireless
systems (i.e., multihop cell systems) have been ended up
being a superior system structure for the next generation
systems [2]. It is the general execution of a system, especially
the execution seen by the clients of the system. To
quantitatively gauge nature of node’s management, a few
related perspectives of the system administration are
frequently viewed as, for example, error rates, data transfer capacity, throughput, transmission delay, accessibility, jitter,
and so forth [3].
Specifically, much innovation has been produced to permit
systems to end up as valuable as telephone systems and
additionally supporting new applications with significantly stricter administration requests [4]. QOS give high execution
as far as overhead, transmission delay, flexibility and
versatility. A Mobile Ad Hoc Network is a self -functioning
system of mobile nodes associated in remote setting [5].
Every gadget in MANET is allowed to move autonomously
in any action. The switch is presented to transmit the nodes
accord to their system utilization. More commercial
applications are already being developed. In an ad hoc
wireless network, connections among these mobile nodes
occur via multi-hop wireless connections without the support
from a fixed infrastructure such as a base station.
The rest of the paper is organized as follows: Section II describes the existing works studied by other researchers.
Section III describes the enhanced QoS routing protocols.
Section IV describes the performance analysis of the
proposed technique. At last, concludes in Section V. Algorithm : Pseudo code for the QOD routing protocol
executed by a source node.
1: if receive a packet forwarding request from a source
node then
2: if this.SpaceUtility < threshold then
3: Reply to the source node.
4: end if 5: end if
6: if receive forwarding request replies for neighbor
nodes then
7: Determine the packet size SpðiÞ to each neighbor i
based on Equation (5).
8: Estimate the queuing delay Tw for the packet for
each neighbor based on Equation (4).
9: Determine the qualified neighbors that can satisfy
the deadline requirements based on Tw
10: Sort the qualified nodes in descending order of Tw
11: Allocate workload rate Ai for each node based on
Equation (3).
South Asian Journal of Engineering and Technology Vol.2, No.42 (2016) 8–13
9
12: for each intermediate node ni in the sorted list do
13: Send packets to ni with transmission interval
SpðiÞ Ai .
14: end for
15: end if
II. RELATED WORK
A dominant part of QoS routing systems depend on
effective allocation and usage of the resources where the
source nodes transmits the test messages in order to check the
sustainability of the route establishment. Perkins et al
amplified the AODV routing convention by including data of
the most extreme delay and least accessible transmission
capacity of each neighbor in a routing table of a node. Jiang
proposed to save the assets from the hubs with higher
connection solidness to decrease the impacts of hub
portability. Liao proposed an expansion of the DSR directing
convention by holding assets in the space time. Vengataramanan et al. proposed scheduling techniques to
guarantee the buffer usage at the base systems. These works
concentrate on boosting system limit in view of scheduling
and ensure the QoS delay transmission systems. The traffic
load are balanced properly, the reliability of the route is
achieved.
Shen proposed to give a source hub a chance to bring the
lost packets from its neighbors to recoup the multicast
movement. Shen and Thomas proposed system to expand
both the QoS and security of the routing systems. Li
proposed an algorithm to advance the QoS execution by
considering cross-layer model over the physical layer model, MAC layer, also, network layer. QOD intends to give QoS
ensured routing systems.
Wei et al proposed a packet forwarding systems, in which
the source hub adaptively picks direct transmission and
forward transmission to the base stations. Dissimilar to the
above works, QOD means to give QoS guaranteed routing
convention protocols. QOD completely takes favorable
position of the generally conveyed APs, regards the packet
transmission issue as a resource scheduling source between
hubs and APs.
III. ENHANCED QOS ORIENTED DISTRIBUTED
ROUTING PROTOCOL
This section explains the working of the QoS
oriented distributed routing protocol (QOD). The proposed
QOD system operates in four modules. The four modules are
explained as follows:
A. Network Configuration:
Let us assume a network model that consists of 35
nodes. These nodes are randomly distributed in area size of
1000 * 800 sq/m. The transmission range of the node is set
to 250m. The data traffic is generated at the rate of
millisecond for 100 packets. The nodes are randomly
generated and assigned as source nodes. The maximum
queue length per node is set to 50 packets. A newly generated
packet is accepted by the source only if its buffer is not full.
B. Neighbour Selection:
The intermediate nodes are used for allocating the
highest packets. It forwards the packets when its first in the
priority lists. In order to avoid congestion, queue length
threshold is maintained for each node. Hence, the QOD
routing protocols are successfully achieved. When the source
node obtains the forward request, it will be acknowledged
only when utility of an intermediate node less than threshold e space. The acknowledged message will contain rate of the
workload and the queuing packets delay. Based on the reply
from neighbor nodes, the source node will chose the forward
packets for calculating the delay.
C. Packet Scheduling
Packet scheduling is the module that utilized for
calculating stream transmission rate. In this phase, a
distributed packet scheduling algorithm is designed for the routing the packets. The queuing delays process contains two
delays as highest queuing and lowest queuing process. The
highest queuing delay process contains earlier generated
packets and the lowest queuing delays contain recently
generated packets. By doing so, the stream transmission rate
is reduced.
Let t be the time taken for generating the packets and
TQoS that denotes delay QoS requirements. The bandwidth
of source node and intermediate node is given as WS and WI.
Let Tw denote the packet queuing time and Tw(i) denote the
packet queuing time of ni. The source node needs to calculate Tw of each intermediate node to select intermediate nodes
that can send its packets by the deadline.
D. Data redundancy elimination
In QOD process, the Access points and mobile nodes
contain the overhear and cache packets. The overhear packets
contain the received packets. Before transmitting the packets,
it contain the content the packets in the cache. And also
signature is embedded with those chunks to enhance the
reliability of the packets. When the AP receives the signature, it searches the signature in its local cache. If the AP caches
the chunk associated with the signature, it sends a
confirmation message to the sender and replaces the
signature with the matched data chunk. Otherwise, the AP
requests the chunk of the signature from the sender.
South Asian Journal of Engineering and Technology Vol.2, No.42 (2016) 8–13
10
Fig.3.1 Block diagram – Proposed Model
Fig.3.2 Working sequence of the network model
IV. EXPERIMENTAL DESIGNS
In this section, we validate the proposed
techniques using NS2 simulator.
Fig.4.1 Creation of the nodes
Fig.4.2 Declaration of the source node and the data is transmitted to the
intermediate nodes
Fig.4.3 Source node transmits the data to its intermediate nodes, to reach the
destination node.
South Asian Journal of Engineering and Technology Vol.2, No.42 (2016) 8–13
11
Fig.4.4 Source node 12 transmits the data to its intermediate node 8, to reach
the destination node at time 1.5
Fig.4.5 Source node transmits the data to its intermediate nodes, to reach the
destination node.
Fig.4.6 Chunk stored at node 7.
Fig. 4.7. Source node 20 decide to transmit the node 7
South Asian Journal of Engineering and Technology Vol.2, No.42 (2016) 8–13
12
Fig.4.8 Throughput analysis
Fig.4.9 Packet Loss- Ratio analysis
Fig.4.10. End to End Delay analysis
V. CONCLUSION
Hybrid wireless networks that integrate MANETs with infrastructure wireless networks have proven to be a better
network structure. In this paper, we propose a QoS oriented
distributed routing protocol (QOD) for hybrid networks to
provide QoS services in different dynamic scenario. In QOD,
a source node directly transmits packets to an AP if the direct
transmission can generate the QoS of the traffic different the
source node schedules the packets to a number of qualified
neighbor nodes. The QoS-guaranteed neighbor selection
algorithm chooses best neighbors for packet transformed.
The distributed packet scheduling algorithm schedules the
packet transmission to further reduce the packet transmission
time. The traffic redundant elimination-based transmission algorithm can further increase the transmission delay. An
experimental design proves the effectiveness of the system in
terms of End to End delay, Packet loss ratio analysis and
Throughput.
REFERENCES
[1] Dr. Shuchita Upadhayaya and Charu Gandhi “Quality of service
routing in Mobile ad hoc networks using Location and energy
parameters”, International Journal of Wireless & Mobile Networks
(IJWMN), Vol 1, No 2, November 2009
[2] Sunil Taneja and Ashwani Kush “A Survey of Routing Protocols in
Mobile Ad Hoc Networks” International Journal of Innovation,
Management and Technology, Vol. 1, No. 3, August 2010 ISSN:
2010-0248.
[3] V.G.Muralishankar et al, “Routing Protocols for MANET:A
Literature Survey”, International Journal of Computer Science and
Mobile Applications, Vol.2 Issue. 3, March- 2014, pg. 18-24
[4] H. Luo, R. Ramjeey, P. Sinhaz, L. Liy, and S. Lu, “UCAN: A Unified
Cell and Ad-Hoc Network Architecture,” Proc. ACM MobiCom,
2003.
[5] P.K. Mckinley, H. Xu, A. Esfahanian, and L.M. Ni, “Unicast-Based
Multicast Communication in Wormhole-Routed Direct Networks,”
South Asian Journal of Engineering and Technology Vol.2, No.42 (2016) 8–13
13
IEEE Trans. Parallel Data and DistributedSystems, vol. 5, no. 12, pp.
1252-1265, Dec. 1992.
[6] H. Wu, C. Qiao, S. De, and O. Tonguz, Integrated Cell and Ad Hoc
Relaying Systems: iCAR,” IEEE J. Selected Areas in Comm., vol. 19,
no. 10, pp. 2105-2115, Oct. 2001.
[7] J. Zhou and Y.R. Yang, “PAR CelS: Pervasive Ad-Hoc Relaying for
Cell Systems,” Proc. IFIP Mediterranean Ad Hoc Networking
Workshop (Med-Hoc-Net), 2002.
[8] R. Braden, D. Clark, and S. Shenker, Integrated Services in the
Internet Architecture: An Overview, IETF RFC 1633, 1994.
[9] Z. Li and H. Shen, “A QoS-Oriented Distributed Routing Protocol for
Hybrid Networks,” Proc. IEEE Seventh Int’l Conf. Mobile Adhoc and
Sensor Systems, 2010.
[10] J. Li, C. Blake, S. Douglas, H. Lee, and R. Morris, “Capacity of Ad
Hoc Wireless Networks,” Proc. ACM MobiCom, 2001.
[11] Crawley, R. Nair, B. Rajagopalan, and H. Sandick, Resource
Reservation Protocol RSVP, IETF RFC 2205, 1998.
[12] Jawhar and J. Wu, “Quality of Service Routing in Mobile Ad Hoc
Networks,” Network Theory and Applications, Springer, 2004.
[13] T. Reddy, I. Karthigeyan, B. Manoj, and C. Murthy, “Quality of
Service Provisioning in Ad Hoc Wireless Networks: A Survey of
Issues and Solutions,” Ad Hoc Networks, vol. 4, no. 1, pp. 83-124,
2006.
[14] X. Du, “QoS Routing Based on Multi-Class Nodes for Mobile Ad
Hoc Networks,” Ad Hoc Networks, vol. 2, pp. 241-254, 2004.
[15] S. Jiang, Y. Liu, Y. Jiang, and Q. Yin, “Provisioning of Adaptability
to Variable Topologies for Routing Schemes in MANETs,” IEEE J.
Selected Areas in Comm., vol. 22, no. 7, pp. 1347-1356, Sept. 2004.
[16] M. Conti, E. Gregori, and G. Maselli, “Reliable and Efficient
Forwarding in Ad Hoc Networks,” Ad Hoc Networks, vol. 4, pp. 398-
415, 2006.
[17] G. Chakrabarti and S. Kulkarni, “Load Balancing and Resource
Reservation in Mobile Ad Hoc Networks,” Ad Hoc Networks, vol. 4,
pp. 186- 203, 2006.
[18] Argyriou and V. Madisetti, “Using a New Protocol to Enhance Path
Reliability and Realize Load Balancing in Mobile Ad Hoc Networks,”
Ad Hoc Networks, vol. 4, pp. 60-74, 2006.
[19] C. Shen and S. Rajagopalan, “Protocol-Independent Multicast Packet
Delivery Improvement Service for Mobile Ad Hoc Networks,” Ad
Hoc Networks, vol. 5, pp. 210-227, 2007.
[20] C.E. Perkins, E.M. Royer, and S.R. Das, Quality of Service in Ad Hoc
On-Demand Distance Vector Routing, IETF Internet draft, 2001.