The importance of IPv6 Routing Protocol for Low power and Lossy Networks (LLNs), also called RPL, has motivated in the development of a robust and quality of service (QoS) oriented Multi-Constraints Adaptive Link Quality Index (MALQI) based routing protocol. Unlike classical RPL protocols, MALQI enables mobile-RPL while ensuring fault-resilient, reliable and QoS communication over LLNs. MALQI protocol exploits key novelties such as signal strength based mobile node positioning, average received signal strength indicator (ARSSI) and ETX based objective function for fault tolerant best forwarding path selection. The functional architecture of MALQI enables it to be used as the parallel to the link layer RPL that even in the case of link failure can assist efficient data delivery over LLNs. Once detecting link outage, MALQI can execute node discover and best forwarding path selection to assist QoS delivery. Contiki-Cooja based simulation reveals that MALQI based mobile-RPL outperforms other state-of-art routing protocols.
International Journal of Engineering Research and Applications (IJERA) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
A Bandwidth Efficient Scheduling Framework for Non Real Time Applications in ...ijdpsjournal
The key concern on the bandwidth allocation and scheduling for non real time traffic are the fulfillment of its minimum throughput requirement and improvement of bandwidth utilization with acceptable delay. This paper proposes a simple and efficient scheduling framework for allocating bandwidth to non real time
polling service (nrtPS) users in IEEE 802.16 networks. In this framework, jointly selective repeat ARQ at the MAC layer and adaptive modulation and coding techniques at the physical are considered. Numerical simulations demonstrate that the proposed scheduling approach provides a graceful compromise between bandwidth utilization and packet delivery delay while maintaining the minimum throughput requirements of nrtPS applications. Thus proves the efficiency of the proposed framework. The simulation is done for unicast scenario.
Joint Routing and Congestion Control in Multipath Channel based on Signal to ...IJECEIAES
Routing protocol and congestion control in Transmission Control Protocol (TCP) have important roles in wireless mobile network performance. In wireless communication, the stability of the path and successful data transmission will be influenced by the channel condition. This channel condition constraints come from path loss and the multipath channel fading. With these constraints, the algorithm in the routing protocol and congestion control is confronted with the uncertainty of connection quality and probability of successful packet transmission, respectively. It is important to investigate the reliability and robustness of routing protocol and congestion control algorithms in dealing with such situation. In this paper, we develop a detailed approach and analytical throughput performance with a cross layer scheme (CLS) between routing and congestion control mechanism based on signal to noise ratio (SNR) in Rician and Rayleigh as multipath fading channel. We proposed joint routing and congestion control TCP with a cross layer scheme model based on SNR (RTCP-SNR). We compare the performance of RTCP-SNR with conventional routing-TCP and routing-TCP that used CLS with routing aware (RTCP-RA) model. The analyses and the simulation results showed that RTCP-SNR in a multipath channel outperforms conventional routing-TCP and RTCP-RA.
ECA MODEL BASED QOS AODV ROUTING FOR MANETSIJCNCJournal
Applications like banking, interactive multimedia, movie on demand, VOIP, etc., are delay sensitive by
nature. The QoS given to users will be affected by network delay, which can be mitigated by employing
QoS routing and efficient data transfer. To build routing table, normal AODV routing uses flooding
technique, which will not consider QoS requirements. Hence QoS based routing which is stable for the
entire application is essential, which understands the dynamic nature of the MANET and establishes the
required route, in minimum possible time. We have proposed an intelligent routing protocol based ECA
model and AODV for establishing QoS route.
The simulation results shows that the ECA model gives better results, while considering the local
connectivity time, source to destination connectivity time, number of data packets successfully delivered to
the destination, local and global error correction time, compared to AODV.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
CONGESTION AWARE LINK COST ROUTING FOR MANETSIJCNCJournal
Due to the dynamic topology, self-configuration and decentralized nature of Mobile Ad hoc Network
(MANET), it provides many benefits in wireless networks and is easy to deploy. But the transmission of
data over ad hoc networks has elevated many technical issues for successful routing. Congestion is one of
the important issues which cause performance degradation of a network, due to long delay and high packet
loss. This paper proposes a Congestion aware Link Cost Routing for MANET where the protocol finds a
path with optimized linked cost based on SNR, Link delay, and the and remaining battery power. Along
with this optimization, in this protocol, every node finds its congestion status and participates in the route
discovery on the basis of its status. Data forwarding is also done based on the congestion status at the time
of forwarding. The protocol results in better performance in terms of packet delivery fraction, end to end
delay, throughput, and packet drop when compared to existing protocols.
International Journal of Engineering Research and Applications (IJERA) aims to cover the latest outstanding developments in the field of all Engineering Technologies & science.
International Journal of Engineering Research and Applications (IJERA) is a team of researchers not publication services or private publications running the journals for monetary benefits, we are association of scientists and academia who focus only on supporting authors who want to publish their work. The articles published in our journal can be accessed online, all the articles will be archived for real time access.
Our journal system primarily aims to bring out the research talent and the works done by sciaentists, academia, engineers, practitioners, scholars, post graduate students of engineering and science. This journal aims to cover the scientific research in a broader sense and not publishing a niche area of research facilitating researchers from various verticals to publish their papers. It is also aimed to provide a platform for the researchers to publish in a shorter of time, enabling them to continue further All articles published are freely available to scientific researchers in the Government agencies,educators and the general public. We are taking serious efforts to promote our journal across the globe in various ways, we are sure that our journal will act as a scientific platform for all researchers to publish their works online.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
INVESTIGATING MULTILAYER OMEGA-TYPE NETWORKS OPERATING WITH THE CUT-THROUGH T...IJCNCJournal
The continuous increase in the complexity of data networks has motivated the development of more effective Multistage Interconnection Networks (MINs) as important factors in providing higher data transfer rates in various switching divisions. In this paper, semi-layer omega-class networks operating with a cut-through forwarding technique are chosen as test-bed subjects for detailed evaluation, and this network architecture is modelled, inspected, and simulated. The results are examined for relevant singlelayer omega networks operating with cut-through or ‘store and forward’ forwarding techniques. Two series of experiments are carried out: one concerns the case of uniform traffic, while the other is related to hotspot traffic. The results quantify the way in which this network outperforms the corresponding singlelayer network architectures for the same network size and buffer size. Furthermore, the effects of the dimensions of the switch elements and their corresponding reliability on the overall interconnection system are investigated, and the complexity and the relevant cost are examined. The data yielded by this investigation can be valuable to MIN engineers and can allow them to achieve more productive networks with lower overall implementation costs.
A Bandwidth Efficient Scheduling Framework for Non Real Time Applications in ...ijdpsjournal
The key concern on the bandwidth allocation and scheduling for non real time traffic are the fulfillment of its minimum throughput requirement and improvement of bandwidth utilization with acceptable delay. This paper proposes a simple and efficient scheduling framework for allocating bandwidth to non real time
polling service (nrtPS) users in IEEE 802.16 networks. In this framework, jointly selective repeat ARQ at the MAC layer and adaptive modulation and coding techniques at the physical are considered. Numerical simulations demonstrate that the proposed scheduling approach provides a graceful compromise between bandwidth utilization and packet delivery delay while maintaining the minimum throughput requirements of nrtPS applications. Thus proves the efficiency of the proposed framework. The simulation is done for unicast scenario.
Joint Routing and Congestion Control in Multipath Channel based on Signal to ...IJECEIAES
Routing protocol and congestion control in Transmission Control Protocol (TCP) have important roles in wireless mobile network performance. In wireless communication, the stability of the path and successful data transmission will be influenced by the channel condition. This channel condition constraints come from path loss and the multipath channel fading. With these constraints, the algorithm in the routing protocol and congestion control is confronted with the uncertainty of connection quality and probability of successful packet transmission, respectively. It is important to investigate the reliability and robustness of routing protocol and congestion control algorithms in dealing with such situation. In this paper, we develop a detailed approach and analytical throughput performance with a cross layer scheme (CLS) between routing and congestion control mechanism based on signal to noise ratio (SNR) in Rician and Rayleigh as multipath fading channel. We proposed joint routing and congestion control TCP with a cross layer scheme model based on SNR (RTCP-SNR). We compare the performance of RTCP-SNR with conventional routing-TCP and routing-TCP that used CLS with routing aware (RTCP-RA) model. The analyses and the simulation results showed that RTCP-SNR in a multipath channel outperforms conventional routing-TCP and RTCP-RA.
ECA MODEL BASED QOS AODV ROUTING FOR MANETSIJCNCJournal
Applications like banking, interactive multimedia, movie on demand, VOIP, etc., are delay sensitive by
nature. The QoS given to users will be affected by network delay, which can be mitigated by employing
QoS routing and efficient data transfer. To build routing table, normal AODV routing uses flooding
technique, which will not consider QoS requirements. Hence QoS based routing which is stable for the
entire application is essential, which understands the dynamic nature of the MANET and establishes the
required route, in minimum possible time. We have proposed an intelligent routing protocol based ECA
model and AODV for establishing QoS route.
The simulation results shows that the ECA model gives better results, while considering the local
connectivity time, source to destination connectivity time, number of data packets successfully delivered to
the destination, local and global error correction time, compared to AODV.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
CONGESTION AWARE LINK COST ROUTING FOR MANETSIJCNCJournal
Due to the dynamic topology, self-configuration and decentralized nature of Mobile Ad hoc Network
(MANET), it provides many benefits in wireless networks and is easy to deploy. But the transmission of
data over ad hoc networks has elevated many technical issues for successful routing. Congestion is one of
the important issues which cause performance degradation of a network, due to long delay and high packet
loss. This paper proposes a Congestion aware Link Cost Routing for MANET where the protocol finds a
path with optimized linked cost based on SNR, Link delay, and the and remaining battery power. Along
with this optimization, in this protocol, every node finds its congestion status and participates in the route
discovery on the basis of its status. Data forwarding is also done based on the congestion status at the time
of forwarding. The protocol results in better performance in terms of packet delivery fraction, end to end
delay, throughput, and packet drop when compared to existing protocols.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
Link Prediction And Link Establishment Based On Network Nodes Life Time In Mo...inventionjournals
In this paper we propose a new modified adhoc routing algorithm for adhoc network that locally repairs a link failure and also conflicts the noise and link modification simultaneously. Due to topology changes caused by nodes’ mobility in adhoc network, the link routes get disconnected frequently. Our proposed scheme does a local repair of link failure and also takes care of malicious nodes with the help of a reliability measure while performing route discovery using link-prediction routing algorithm(LPRA). These two performance metrics are integrated by Route link-prediction algorithm. This algorithm is carried out as follows, Select the least dynamic route link with the longest lifetime for persistent data forwarding. Node Lifetime and link lifetime prediction methods. The receiver can measure the signal strength when it receives the packets from sender in same power level and then it calculates the distance between two nodes by applying the radio propagation model in LPRA using adhoc network. Simulation results show that our proposed schemeperforms better in comparison to a popular existing technique
Rough set based QoS enabled multipath source routing in MANET IJECEIAES
The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multilayer mechanism should be incorporated to maintain QoS metric information spreads across multiple layers of TCP/IP protocol stack. The proposed multipath QoS enabled source routing provides balanced routing by making use of all these features. The imprecise decision making strategy called Rough Set Theory (RST) is used at destination node for decision making. The Route REQuest (RREQ) messages coming from different routes are filtered by considering the QoS metrics of each and every route by making use of RST. The Route REPly (RREP) messages are generated and delivered to the source node for filtered RREQ messages. The proposed routing algorithm will reduce load on the network by reducing number of control messages exchanged for route establishment. This will evenly distribute load among all the nodes and it also avoid the scenarios like few nodes starved for resources. Finally, multipath routing always provides alternate routing option in case of route failure.
The article looks into the current state of the art of dynamic routing protocols with respect to their
possibilities to react to changes in the Quality of Service when selecting the best route towards a
destination network. New options that could leverage information about the ever changing QoS parameters
for data communication are analysed and a Cisco Performance Routing solution is described more in
detail. The practical part of this work focuses on a design and implementation of a test bed that provides a
scalable laboratory architecture to manipulate QoS parameters of different data communications flowing
through it. The test bed is used in various use cases that were used to evaluate Cisco Performance Routing
optimization capabilities in different scenarios.
final Year Projects, Final Year Projects in Chennai, Software Projects, Embedded Projects, Microcontrollers Projects, DSP Projects, VLSI Projects, Matlab Projects, Java Projects, .NET Projects, IEEE Projects, IEEE 2009 Projects, IEEE 2009 Projects, Software, IEEE 2009 Projects, Embedded, Software IEEE 2009 Projects, Embedded IEEE 2009 Projects, Final Year Project Titles, Final Year Project Reports, Final Year Project Review, Robotics Projects, Mechanical Projects, Electrical Projects, Power Electronics Projects, Power System Projects, Model Projects, Java Projects, J2EE Projects, Engineering Projects, Student Projects, Engineering College Projects, MCA Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, Wireless Networks Projects, Network Security Projects, Networking Projects, final year projects, ieee projects, student projects, college projects, ieee projects in chennai, java projects, software ieee projects, embedded ieee projects, "ieee2009projects", "final year projects", "ieee projects", "Engineering Projects", "Final Year Projects in Chennai", "Final year Projects at Chennai", Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, Final Year Java Projects, Final Year ASP.NET Projects, Final Year VB.NET Projects, Final Year C# Projects, Final Year Visual C++ Projects, Final Year Matlab Projects, Final Year NS2 Projects, Final Year C Projects, Final Year Microcontroller Projects, Final Year ATMEL Projects, Final Year PIC Projects, Final Year ARM Projects, Final Year DSP Projects, Final Year VLSI Projects, Final Year FPGA Projects, Final Year CPLD Projects, Final Year Power Electronics Projects, Final Year Electrical Projects, Final Year Robotics Projects, Final Year Solor Projects, Final Year MEMS Projects, Final Year J2EE Projects, Final Year J2ME Projects, Final Year AJAX Projects, Final Year Structs Projects, Final Year EJB Projects, Final Year Real Time Projects, Final Year Live Projects, Final Year Student Projects, Final Year Engineering Projects, Final Year MCA Projects, Final Year MBA Projects, Final Year College Projects, Final Year BE Projects, Final Year BTech Projects, Final Year ME Projects, Final Year MTech Projects, Final Year M.Sc Projects, IEEE Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, IEEE 2009 Java Projects, IEEE 2009 ASP.NET Projects, IEEE 2009 VB.NET Projects, IEEE 2009 C# Projects, IEEE 2009 Visual C++ Projects, IEEE 2009 Matlab Projects, IEEE 2009 NS2 Projects, IEEE 2009 C Projects, IEEE 2009 Microcontroller Projects, IEEE 2009 ATMEL Projects, IEEE 2009 PIC Projects, IEEE 2009 ARM Projects, IEEE 2009 DSP Projects, IEEE 2009 VLSI Projects, IEEE 2009 FPGA Projects, IEEE 2009 CPLD Projects, IEEE 2009 Power Electronics Projects, IEEE 2009 Electrical Projects, IEEE 2009 Robotics Projects, IEEE 2009 Solor Projects, IEEE 2009 MEMS Projects, IEEE 2009 J2EE P
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
Congestion Control and QOS Improvement for AEERG protocol in MANET pijans
QOS improvement has been a subject of intensive discussion. The research in the network field for
congestion control is by means of scheduling packets from different traffic flows for processing at a specific
node. When that particular node is selected for the transmission of all traffic flows since it has been chosen
as an emerging node for the shortest path in the adaptive energy efficient algorithm, queue scheduling
disciplines have been used to improve the quality of service. In this paper, we evaluate the performance of
four queuing disciplines (FIFO, PQ, RED and WFQ) which is implemented in the AEERG protocol. This
paper gives the NS-2 simulation results to compare their relative performance based on queuing delay,
packet drop rate and end-to-end delay for the above queuing techniques.
A NOVEL HYBRID OPPORTUNISTIC SCALABLE ENERGY EFFICIENT ROUTING DESIGN FOR LOW...IJCNCJournal
Opportunistic Routing (OR) scheme increases the transmission reliability despite the lossy wireless radio links by exploiting the broadcast nature of the wireless medium. However, OR schemes in low power Wireless Sensor Network (WSN) leads to energy drain in constrained sensor nodes due to constant
overhearing, periodic beaconing for Neighbourhood Management (NM) and increase in packet header length to append priority wise sorted Forwarding Candidates Set (FCS) prior to data transmission. The timer-based coordination mechanism incurs the least overhead to coordinate among the FCS that has successfully received the data packet for relaying the data in a multi-hop manner. This timer-based mechanism suffers from duplicate transmissions if the FCS is either not carefully selected or coordinated. The focus of this work is to propose a hybrid opportunistic energy efficient routing design for large scale, low power and lossy WSN. This design avoids periodic 'hello' beacons for NM, limits constant overhearing and increase in packet header length. There are two modes of operation i) opportunistic ii) unicast mode. The sender node adopts opportunistic forwarding for its initial data packet transmission and instead of pre-computing the FCS, it is dynamically computed in a completely distributed manner. The
eligible nodes to be part of FCS will be neighbour nodes at lower corona level than the sender with respect to the sink and remaining energy above the minimum threshold. The nodes part of FCS based on crosslayered multi-metrics and fuzzy decision logic determines its priority level to compute Dynamic Holding
Delay (DHD) for effective timer coordination. The differentiated back off implementation along with DHD enables the higher priority candidate that had received data packet to forward the packet first and facilitates others to cancel its timer upon overhearing. The sender node switches to unicast mode of
forwarding for successive transmissions by choosing the forwarding node with maximum trust value as it
denotes the stability of the temporally varying link with respect to the forwarder. The sender node will revert to opportunistic mode to increase transmission reliability in case of link-level transmission error or no trustworthy forwarders. Simulation results in NS2 show significant increase in Packet Delivery Ratio (PDR),decrease in both average energy consumption per node and Normalized Energy Consumption (NEC) per packet in comparison with existing protocols.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
AN EFFICIENT AND STABLE ROUTING ALGORITHM IN MOBILE AD HOC NETWORKIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
CONGESTION CONTROL USING FUZZY BASED LSPS IN MULTIPROTOCOL LABEL SWITCHING NE...ijfcstjournal
In this paper, we have proposed a fuzzy based decision making component for high volume traffic MPLS
networks, by implementing Traffic Engineering, Quality of Service and Multipath routing. The approach
explicitly proves to be successful in solving the issues and challenges pertaining to stability, scalability in
high volume and dynamic traffic. Furthermore, it will work to handle congestion by higher link utilization
and provides efficient rerouting of traffic along with fault tolerance in the network. In this research work,
fuzzy calculations are done for fixing the attributes of the MPLS label(s), which is put on particular packet
representing the Forwarding Equivalence Class. Fuzzy controller consists of two sub fuzzy systems- Label
Switched Path setup System (LsS) and Traffic Splitting System (TSS). The computation of dynamic status of
Load and Delay is utilized by LsS to arrange the paths in preference order. The attained Link Capacity and
Utilization Rate are employing by TSS for maintaining congestion free path. The impact of this is to
facilitate, we have better decision making for splitting the traffic for different promising paths. This was
apparent from the series of traffic scenarios. Observations are obtained using this realization.
CONGESTION CONTROL USING FUZZY BASED LSPS IN MULTIPROTOCOL LABEL SWITCHING NE...ijfcstjournal
In this paper, we have proposed a fuzzy based decision making component for high volume traffic MPLS
networks, by implementing Traffic Engineering, Quality of Service and Multipath routing. The approach
explicitly proves to be successful in solving the issues and challenges pertaining to stability, scalability in
high volume and dynamic traffic. Furthermore, it will work to handle congestion by higher link utilization
and provides efficient rerouting of traffic along with fault tolerance in the network. In this research work,
fuzzy calculations are done for fixing the attributes of the MPLS label(s), which is put on particular packet
representing the Forwarding Equivalence Class. Fuzzy controller consists of two sub fuzzy systems- Label
Switched Path setup System (LsS) and Traffic Splitting System (TSS). The computation of dynamic status of
Load and Delay is utilized by LsS to arrange the paths in preference order. The attained Link Capacity and
Utilization Rate are employing by TSS for maintaining congestion free path. The impact of this is to
facilitate, we have better decision making for splitting the traffic for different promising paths. This was
apparent from the series of traffic scenarios. Observations are obtained using this realization.
CONGESTION CONTROL USING FUZZY BASED LSPS IN MULTIPROTOCOL LABEL SWITCHING NE...ijfcstjournal
In this paper, we have proposed a fuzzy based decision making component for high volume traffic MPLS
networks, by implementing Traffic Engineering, Quality of Service and Multipath routing. The approach
explicitly proves to be successful in solving the issues and challenges pertaining to stability, scalability in
high volume and dynamic traffic. Furthermore, it will work to handle congestion by higher link utilization
and provides efficient rerouting of traffic along with fault tolerance in the network. In this research work,
fuzzy calculations are done for fixing the attributes of the MPLS label(s), which is put on particular packet
representing the Forwarding Equivalence Class. Fuzzy controller consists of two sub fuzzy systems- Label
Switched Path setup System (LsS) and Traffic Splitting System (TSS). The computation of dynamic status of
Load and Delay is utilized by LsS to arrange the paths in preference order. The attained Link Capacity and
Utilization Rate are employing by TSS for maintaining congestion free path. The impact of this is to
facilitate, we have better decision making for splitting the traffic for different promising paths. This was
apparent from the series of traffic scenarios. Observations are obtained using this realization.
AN EFFECTIVE CONTROL OF HELLO PROCESS FOR ROUTING PROTOCOL IN MANETSIJCNCJournal
In the mobile ad hoc network (MANET) update of link connectivity is necessary to refresh the neighbor tables in data transfer. A existing hello process periodically exchanges the link connectivity information, which is not adequate for dynamic topology. Here, slow update of neighbour table entries causes link failures which affect performance parameter as packet drop, maximum delay, energy consumption, and reduced throughput. In the dynamic hello technique, new neighbour nodes and lost neighbour nodes are used to compute link change rate (LCR) and hello-interval/refresh rate (r). Exchange of link connectivity information at a fast rate consumes unnecessary bandwidth and energy. In MANET resource wastage can be controlled by avoiding the re-route discovery, frequent error notification, and local repair in the entire network. We are enhancing the existing hello process, which shows significant improvement in performance.
Link Prediction And Link Establishment Based On Network Nodes Life Time In Mo...inventionjournals
In this paper we propose a new modified adhoc routing algorithm for adhoc network that locally repairs a link failure and also conflicts the noise and link modification simultaneously. Due to topology changes caused by nodes’ mobility in adhoc network, the link routes get disconnected frequently. Our proposed scheme does a local repair of link failure and also takes care of malicious nodes with the help of a reliability measure while performing route discovery using link-prediction routing algorithm(LPRA). These two performance metrics are integrated by Route link-prediction algorithm. This algorithm is carried out as follows, Select the least dynamic route link with the longest lifetime for persistent data forwarding. Node Lifetime and link lifetime prediction methods. The receiver can measure the signal strength when it receives the packets from sender in same power level and then it calculates the distance between two nodes by applying the radio propagation model in LPRA using adhoc network. Simulation results show that our proposed schemeperforms better in comparison to a popular existing technique
Rough set based QoS enabled multipath source routing in MANET IJECEIAES
The single constrained Quality of Service (QoS) routing in Mobile Ad-hoc NETwork (MANET) is disastrous in consideration of MANET characteristics, inference, collision and link failure as it maintains a single path. The QoS enabled routing yields better packet delivery and maintains consistency among nodes in the network by incorporating multi-constrained and multipath routing. The Dynamic Source Routing (DSR) is best suited source routing algorithm to maintain multipath information at the source node, but performance degrades with larger number of mobile nodes. Multilayer mechanism should be incorporated to maintain QoS metric information spreads across multiple layers of TCP/IP protocol stack. The proposed multipath QoS enabled source routing provides balanced routing by making use of all these features. The imprecise decision making strategy called Rough Set Theory (RST) is used at destination node for decision making. The Route REQuest (RREQ) messages coming from different routes are filtered by considering the QoS metrics of each and every route by making use of RST. The Route REPly (RREP) messages are generated and delivered to the source node for filtered RREQ messages. The proposed routing algorithm will reduce load on the network by reducing number of control messages exchanged for route establishment. This will evenly distribute load among all the nodes and it also avoid the scenarios like few nodes starved for resources. Finally, multipath routing always provides alternate routing option in case of route failure.
The article looks into the current state of the art of dynamic routing protocols with respect to their
possibilities to react to changes in the Quality of Service when selecting the best route towards a
destination network. New options that could leverage information about the ever changing QoS parameters
for data communication are analysed and a Cisco Performance Routing solution is described more in
detail. The practical part of this work focuses on a design and implementation of a test bed that provides a
scalable laboratory architecture to manipulate QoS parameters of different data communications flowing
through it. The test bed is used in various use cases that were used to evaluate Cisco Performance Routing
optimization capabilities in different scenarios.
final Year Projects, Final Year Projects in Chennai, Software Projects, Embedded Projects, Microcontrollers Projects, DSP Projects, VLSI Projects, Matlab Projects, Java Projects, .NET Projects, IEEE Projects, IEEE 2009 Projects, IEEE 2009 Projects, Software, IEEE 2009 Projects, Embedded, Software IEEE 2009 Projects, Embedded IEEE 2009 Projects, Final Year Project Titles, Final Year Project Reports, Final Year Project Review, Robotics Projects, Mechanical Projects, Electrical Projects, Power Electronics Projects, Power System Projects, Model Projects, Java Projects, J2EE Projects, Engineering Projects, Student Projects, Engineering College Projects, MCA Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, Wireless Networks Projects, Network Security Projects, Networking Projects, final year projects, ieee projects, student projects, college projects, ieee projects in chennai, java projects, software ieee projects, embedded ieee projects, "ieee2009projects", "final year projects", "ieee projects", "Engineering Projects", "Final Year Projects in Chennai", "Final year Projects at Chennai", Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, Final Year Java Projects, Final Year ASP.NET Projects, Final Year VB.NET Projects, Final Year C# Projects, Final Year Visual C++ Projects, Final Year Matlab Projects, Final Year NS2 Projects, Final Year C Projects, Final Year Microcontroller Projects, Final Year ATMEL Projects, Final Year PIC Projects, Final Year ARM Projects, Final Year DSP Projects, Final Year VLSI Projects, Final Year FPGA Projects, Final Year CPLD Projects, Final Year Power Electronics Projects, Final Year Electrical Projects, Final Year Robotics Projects, Final Year Solor Projects, Final Year MEMS Projects, Final Year J2EE Projects, Final Year J2ME Projects, Final Year AJAX Projects, Final Year Structs Projects, Final Year EJB Projects, Final Year Real Time Projects, Final Year Live Projects, Final Year Student Projects, Final Year Engineering Projects, Final Year MCA Projects, Final Year MBA Projects, Final Year College Projects, Final Year BE Projects, Final Year BTech Projects, Final Year ME Projects, Final Year MTech Projects, Final Year M.Sc Projects, IEEE Java Projects, ASP.NET Projects, VB.NET Projects, C# Projects, Visual C++ Projects, Matlab Projects, NS2 Projects, C Projects, Microcontroller Projects, ATMEL Projects, PIC Projects, ARM Projects, DSP Projects, VLSI Projects, FPGA Projects, CPLD Projects, Power Electronics Projects, Electrical Projects, Robotics Projects, Solor Projects, MEMS Projects, J2EE Projects, J2ME Projects, AJAX Projects, Structs Projects, EJB Projects, Real Time Projects, Live Projects, Student Projects, Engineering Projects, MCA Projects, MBA Projects, College Projects, BE Projects, BTech Projects, ME Projects, MTech Projects, M.Sc Projects, IEEE 2009 Java Projects, IEEE 2009 ASP.NET Projects, IEEE 2009 VB.NET Projects, IEEE 2009 C# Projects, IEEE 2009 Visual C++ Projects, IEEE 2009 Matlab Projects, IEEE 2009 NS2 Projects, IEEE 2009 C Projects, IEEE 2009 Microcontroller Projects, IEEE 2009 ATMEL Projects, IEEE 2009 PIC Projects, IEEE 2009 ARM Projects, IEEE 2009 DSP Projects, IEEE 2009 VLSI Projects, IEEE 2009 FPGA Projects, IEEE 2009 CPLD Projects, IEEE 2009 Power Electronics Projects, IEEE 2009 Electrical Projects, IEEE 2009 Robotics Projects, IEEE 2009 Solor Projects, IEEE 2009 MEMS Projects, IEEE 2009 J2EE P
Adaptive QoS Multicast Routing with Mobility Prediction in MANETs ijasuc
A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.
Congestion Control and QOS Improvement for AEERG protocol in MANET pijans
QOS improvement has been a subject of intensive discussion. The research in the network field for
congestion control is by means of scheduling packets from different traffic flows for processing at a specific
node. When that particular node is selected for the transmission of all traffic flows since it has been chosen
as an emerging node for the shortest path in the adaptive energy efficient algorithm, queue scheduling
disciplines have been used to improve the quality of service. In this paper, we evaluate the performance of
four queuing disciplines (FIFO, PQ, RED and WFQ) which is implemented in the AEERG protocol. This
paper gives the NS-2 simulation results to compare their relative performance based on queuing delay,
packet drop rate and end-to-end delay for the above queuing techniques.
A NOVEL HYBRID OPPORTUNISTIC SCALABLE ENERGY EFFICIENT ROUTING DESIGN FOR LOW...IJCNCJournal
Opportunistic Routing (OR) scheme increases the transmission reliability despite the lossy wireless radio links by exploiting the broadcast nature of the wireless medium. However, OR schemes in low power Wireless Sensor Network (WSN) leads to energy drain in constrained sensor nodes due to constant
overhearing, periodic beaconing for Neighbourhood Management (NM) and increase in packet header length to append priority wise sorted Forwarding Candidates Set (FCS) prior to data transmission. The timer-based coordination mechanism incurs the least overhead to coordinate among the FCS that has successfully received the data packet for relaying the data in a multi-hop manner. This timer-based mechanism suffers from duplicate transmissions if the FCS is either not carefully selected or coordinated. The focus of this work is to propose a hybrid opportunistic energy efficient routing design for large scale, low power and lossy WSN. This design avoids periodic 'hello' beacons for NM, limits constant overhearing and increase in packet header length. There are two modes of operation i) opportunistic ii) unicast mode. The sender node adopts opportunistic forwarding for its initial data packet transmission and instead of pre-computing the FCS, it is dynamically computed in a completely distributed manner. The
eligible nodes to be part of FCS will be neighbour nodes at lower corona level than the sender with respect to the sink and remaining energy above the minimum threshold. The nodes part of FCS based on crosslayered multi-metrics and fuzzy decision logic determines its priority level to compute Dynamic Holding
Delay (DHD) for effective timer coordination. The differentiated back off implementation along with DHD enables the higher priority candidate that had received data packet to forward the packet first and facilitates others to cancel its timer upon overhearing. The sender node switches to unicast mode of
forwarding for successive transmissions by choosing the forwarding node with maximum trust value as it
denotes the stability of the temporally varying link with respect to the forwarder. The sender node will revert to opportunistic mode to increase transmission reliability in case of link-level transmission error or no trustworthy forwarders. Simulation results in NS2 show significant increase in Packet Delivery Ratio (PDR),decrease in both average energy consumption per node and Normalized Energy Consumption (NEC) per packet in comparison with existing protocols.
Mobile ad hoc network is a reconfigurable network of mobile nodes connected by multi-hop wireless links and capable of operating without any fixed infrastructure support. In order to facilitate communication within such self-creating, self-organizing and self administrating network, a dynamic routing protocol is needed. The primary goal of such an ad hoc network routing protocol is to discover and establish a correct and efficient route between a pair of nodes so that messages may be delivered in a timely manner. Route construction should be done with a minimum of overhead and bandwidth consumption. This paper examines two routing protocols, both on-demand source routing, for mobile ad hoc networks– the Dynamic Source Routing (DSR), an flat architecture based and the Cluster Based Routing Protocol (CBRP), a cluster architecture based and evaluates both routing protocols in terms of packet delivery fraction, normalized routing load, average end to end delay, throughput by varying number of nodes per sq. km, traffic sources and mobility. Simulation results show that in high
mobility (pause time 0s) scenarios, CBRP outperforms DSR. CBRP scales well with increasing number of nodes.
AN EFFICIENT AND STABLE ROUTING ALGORITHM IN MOBILE AD HOC NETWORKIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV
An Efficient and Stable Routing Algorithm in Mobile Ad Hoc NetworkIJCNCJournal
Mobile Ad hoc Network (MANET) is mainly designed to set up communication among devices in infrastructure-less wireless communication network. Routing in this kind of communication network is highly affected by its restricted characteristics such as frequent topological changes and limited battery power. Several research works have been carried out to improve routing performance in MANET. However, the overall performance enhancement in terms of packet delivery, delay and control message overhead is still not come into the wrapping up. In order to overcome the addressed issues, an Efficient and Stable-AODV (EFST-AODV) routing scheme has been proposed which is an improvement over AODV to establish a better quality route between source and destination. In this method, we have modified the route request and route reply phase. During the route request phase, cost metric of a route is calculated on the basis of parameters such as residual energy, delay and distance. In a route reply phase, average residual energy and average delay of overall path is calculated and the data forwarding decision is taken at the source node accordingly. Simulation outcomes reveal that the proposed approach gives better results in terms of packet delivery ratio, delay, throughput, normalized routing load and control message overhead as compared to AODV.
CONGESTION CONTROL USING FUZZY BASED LSPS IN MULTIPROTOCOL LABEL SWITCHING NE...ijfcstjournal
In this paper, we have proposed a fuzzy based decision making component for high volume traffic MPLS
networks, by implementing Traffic Engineering, Quality of Service and Multipath routing. The approach
explicitly proves to be successful in solving the issues and challenges pertaining to stability, scalability in
high volume and dynamic traffic. Furthermore, it will work to handle congestion by higher link utilization
and provides efficient rerouting of traffic along with fault tolerance in the network. In this research work,
fuzzy calculations are done for fixing the attributes of the MPLS label(s), which is put on particular packet
representing the Forwarding Equivalence Class. Fuzzy controller consists of two sub fuzzy systems- Label
Switched Path setup System (LsS) and Traffic Splitting System (TSS). The computation of dynamic status of
Load and Delay is utilized by LsS to arrange the paths in preference order. The attained Link Capacity and
Utilization Rate are employing by TSS for maintaining congestion free path. The impact of this is to
facilitate, we have better decision making for splitting the traffic for different promising paths. This was
apparent from the series of traffic scenarios. Observations are obtained using this realization.
CONGESTION CONTROL USING FUZZY BASED LSPS IN MULTIPROTOCOL LABEL SWITCHING NE...ijfcstjournal
In this paper, we have proposed a fuzzy based decision making component for high volume traffic MPLS
networks, by implementing Traffic Engineering, Quality of Service and Multipath routing. The approach
explicitly proves to be successful in solving the issues and challenges pertaining to stability, scalability in
high volume and dynamic traffic. Furthermore, it will work to handle congestion by higher link utilization
and provides efficient rerouting of traffic along with fault tolerance in the network. In this research work,
fuzzy calculations are done for fixing the attributes of the MPLS label(s), which is put on particular packet
representing the Forwarding Equivalence Class. Fuzzy controller consists of two sub fuzzy systems- Label
Switched Path setup System (LsS) and Traffic Splitting System (TSS). The computation of dynamic status of
Load and Delay is utilized by LsS to arrange the paths in preference order. The attained Link Capacity and
Utilization Rate are employing by TSS for maintaining congestion free path. The impact of this is to
facilitate, we have better decision making for splitting the traffic for different promising paths. This was
apparent from the series of traffic scenarios. Observations are obtained using this realization.
CONGESTION CONTROL USING FUZZY BASED LSPS IN MULTIPROTOCOL LABEL SWITCHING NE...ijfcstjournal
In this paper, we have proposed a fuzzy based decision making component for high volume traffic MPLS
networks, by implementing Traffic Engineering, Quality of Service and Multipath routing. The approach
explicitly proves to be successful in solving the issues and challenges pertaining to stability, scalability in
high volume and dynamic traffic. Furthermore, it will work to handle congestion by higher link utilization
and provides efficient rerouting of traffic along with fault tolerance in the network. In this research work,
fuzzy calculations are done for fixing the attributes of the MPLS label(s), which is put on particular packet
representing the Forwarding Equivalence Class. Fuzzy controller consists of two sub fuzzy systems- Label
Switched Path setup System (LsS) and Traffic Splitting System (TSS). The computation of dynamic status of
Load and Delay is utilized by LsS to arrange the paths in preference order. The attained Link Capacity and
Utilization Rate are employing by TSS for maintaining congestion free path. The impact of this is to
facilitate, we have better decision making for splitting the traffic for different promising paths. This was
apparent from the series of traffic scenarios. Observations are obtained using this realization.
Energy and Load Aware Routing Protocol for Internet of ThingsIJAAS Team
Maximizing the network lifetime is one of the major challenges in Low Power and Lossy Networks (LLN). Routing plays a vital role in it by minimizing the energy consumption across the networks through the efficient route selection for data transfer. IPv6 Routing Protocol for Low Power and Lossy Networks (RPL) is a IETF standardized IPv6 routing protocol for LLN. In this paper, we propose Energy and Load aware RPL (EL-RPL) protocol, which is an enhancement of RPL protocol. It uses a composite metric, calculated based on expected transmission count (ETX), Load and battery depletion index (BDI), for the route, selection. The COOJA simulator is used for performance evaluation. EL-RPL is compared with other similar protocols RER(BDI) RPL and fuzzy logic based RPL (OF-FL RPL). The simulation result shows that the EL-RPL improves the network lifetime by 8- 12% and packet delivery ratio 2-4%.
The exponential rise in wireless communication systems and allied applications has revitalized academiaindustries to achieve more efficient data transmission system to meet Quality-of-Service (QoS) demands. Amongst major wireless communication techniques, Mobile Ad-hoc Network (MANET) is found potential to provide decentralized and infrastructure less communication among multiple distributed nodes across network region. However, dynamic network conditions such as changing topology, congestion, packet drop, intrusion possibilities etc often make MANET’s routing a tedious task. On the other hand, mobile network feature broadens the horizon for intruders to penetrate the network and causes performance degradation. Unlike classical MANET protocols where major efforts have been made on single network parameter based routing decision, this research paper proposes a novel Elitist Genetic Algorithm (EGA) Multi-Objective Optimization assisted Network Condition Aware QoS-Routing Protocol for Mobile Ad-hoc Networks (MNCQM). Our proposed MNCQM protocol exhibits two phase implementation where at first it performs node-profiling under dynamic network topology for which three factors; irregular MAC information exchange, queuing overflow and topological variations have been considered. Towards this objective node features like Packet Forwarding Probability (PFP) at the MAC layer, Success Probability of Data Transmission (SPDT) of a neighboring node, and Probability of Successful Data Delivery (PSDD) have been obtained to estimate Node-Trustworthiness Index (NTI), which is further used to eliminate untrustworthy nodes. In the second phase of implementation, a novel Evolutionary Computing assisted nondisjoint best forwarding path selection model is developed that exploits node’s and allied link’s connectivity and availability features to identify the quasi-sub-optimal forwarding paths. EGA algorithm intends to reduce hop-counts, connectivity-loss and node or link unavailability to estimate best forwarding node. One key feature of the proposed model is dual-supplementary forwarding path selection that enables alternate path formation in case of link outage and thus avoids any iterative network discovery phase.
The exponential rise in wireless communication systems and allied applications has revitalized academiaindustries to achieve more efficient data transmission system to meet Quality-of-Service (QoS) demands. Amongst major wireless communication techniques, Mobile Ad-hoc Network (MANET) is found potential to provide decentralized and infrastructure less communication among multiple distributed nodes across network region. However, dynamic network conditions such as changing topology, congestion, packet drop, intrusion possibilities etc often make MANET’s routing a tedious task. On the other hand, mobile network feature broadens the horizon for intruders to penetrate the network and causes performance degradation. Unlike classical MANET protocols where major efforts have been made on single network parameter based routing decision, this research paper proposes a novel Elitist Genetic Algorithm (EGA) Multi-Objective Optimization assisted Network Condition Aware QoS-Routing Protocol for Mobile Ad-hoc Networks (MNCQM). Our proposed MNCQM protocol exhibits two phase implementation where at first it performs node-profiling under dynamic network topology for which three factors; irregular MAC information exchange, queuing overflow and topological variations have been considered. Towards this objective node features like Packet Forwarding Probability (PFP) at the MAC layer, Success Probability of Data Transmission (SPDT) of a neighboring node, and Probability of Successful Data Delivery (PSDD) have been obtained to estimate Node-Trustworthiness Index (NTI), which is further used to eliminate untrustworthy nodes. In the second phase of implementation, a novel Evolutionary Computing assisted nondisjoint best forwarding path selection model is developed that exploits node’s and allied link’s connectivity and availability features to identify the quasi-sub-optimal forwarding paths. EGA algorithm intends to reduce hop-counts, connectivity-loss and node or link unavailability to estimate best forwarding node. One key feature of the proposed model is dual-supplementary forwarding path selection that enables alternate path formation in case of link outage and thus avoids any iterative network discovery phase.
Multipoint Relay Path for Efficient Topology Maintenance Algorithm in Optimiz...IJCNCJournal
The Optimal Link State Routing (OLSR) protocol employs multipoint relay (MPR) nodes to disseminate topology control (TC) messages, enabling network topology discovery and maintenance. However, this approach increases control overhead and leads to wasted network bandwidth in stable topology scenarios due to fixed flooding periods. To address these challenges, this paper presents an Efficient Topology Maintenance Algorithm (ETM-OLSR) for Enhanced Link-State Routing Protocols. By reducing the number of MPR nodes, TC message generation and forwarding frequency are minimized. Furthermore, the algorithm selects a smaller subset of TC messages based on the changes in the MPR selection set from the previous cycle, adapting to stable and fluctuating network conditions. Additionally, the sending cycle of TC messages is dynamically adjusted in response to network topology changes. Simulation results demonstrate that the ETM-OLSR algorithm effectively reduces network control overhead, minimizes end-to-end delay, and improves network throughput compared to traditional OLSR and HTR-OLSR algorithms.
Multipoint Relay Path for Efficient Topology Maintenance Algorithm in Optimiz...IJCNCJournal
The Optimal Link State Routing (OLSR) protocol employs multipoint relay (MPR) nodes to disseminate topology control (TC) messages, enabling network topology discovery and maintenance. However, this approach increases control overhead and leads to wasted network bandwidth in stable topology scenarios due to fixed flooding periods. To address these challenges, this paper presents an Efficient Topology Maintenance Algorithm (ETM-OLSR) for Enhanced Link-State Routing Protocols. By reducing the number of MPR nodes, TC message generation and forwarding frequency are minimized. Furthermore, the algorithm selects a smaller subset of TC messages based on the changes in the MPR selection set from the previous cycle, adapting to stable and fluctuating network conditions. Additionally, the sending cycle of TC messages is dynamically adjusted in response to network topology changes. Simulation results demonstrate that the ETM-OLSR algorithm effectively reduces network control overhead, minimizes end-to-end delay, and improves network throughput compared to traditional OLSR and HTR-OLSR algorithms.
A scalable and power efficient solution for routing in mobile ad hoc network ...ijmnct
Mobile Ad Hoc Network (MANET) is a very dynamic and infrastructure-less ad hoc network. The actual
network size depends on the application and the protocols developed for the routing for this kind of
networks should be scalable. MANET is a resource limited network and therefore the developed routing
algorithm for packet transmission should be power and bandwidth efficient. These kinds of dynamic
networks should operate with minimal management overhead. The management functionality of the
network increases with number of nodes and reduces the performance of the network. Here, in this paper,
we have designed all identical nodes in the cluster except the cluster head and this criterion reduces the
management burden on the network. Graph theoretic routing algorithm is used to develop route for packet
transmission by using the minimum resources. In this paper, we developed routing algorithm for cluster
based MANET and finds a path from source to destination using minimum cumulative degree path. Our
simulation results show that this routing algorithm provide efficient routing path with the increasing
number of nodes and uses multi-hop connectivity for intra-cluster to utilize minimum power for packet
transmission irrespective of number of nodes in the network.
Packet delivery ratio, delay, throughput, routing overhead etc are the strict quality of service requirements
for applications in Ad hoc networks. So, the routing protocol not only finds a suitable path but also the path
should satisfy the QoS constraints also. Quality of services (QoS) aware routing is performed on the basis
of resource availability in the network and the flow of QoS requirement. In this paper we developed a
source routing protocol which satisfying the link bandwidth and end –to- end delay factor. Our protocol
will find multiple paths between the source and the destination, out of those one will be selected for data
transfer and others are reserve at the source node those can be used for route maintenance purpose. The
path selection is strictly based on the bandwidth and end-to-end delay in case two or more then two paths
are having the same values for QoS constraints then we will use hop as a parameter for path selection.
Similar to MULTI-CONSTRAINTS ADAPTIVE LINK QUALITY INDEX BASED MOBILE-RPL ROUTING PROTOCOL FOR LOW POWER LOSSY NETWORKS (20)
Vehicle Ad Hoc Networks (VANETs) have become a viable technology to improve traffic flow and safety on the roads. Due to its effectiveness and scalability, the Wingsuit Search-based Optimised Link State Routing Protocol (WS-OLSR) is frequently used for data distribution in VANETs. However, the selection of MultiPoint Relays (MPRs) plays a pivotal role in WS-OLSR's performance. This paper presents an improved MPR selection algorithm tailored to WS-OLSR, designed to enhance the overall routing efficiency and reduce overhead. The analysis found that the current OLSR protocol has problems such as redundancy of HELLO and TC message packets or failure to update routing information in time, so a WS-OLSR routing protocol based on improved-MPR selection algorithm was proposed. Firstly, factors such as node mobility and link changes are comprehensively considered to reflect network topology changes, and the broadcast cycle of node HELLO messages is controlled through topology changes. Secondly, a new MPR selection algorithm is proposed, considering link stability issues and nodes. Finally, evaluate its effectiveness in terms of packet delivery ratio, end-to-end delay, and control message overhead. Simulation results demonstrate the superior performance of our improved MR selection algorithm when compared to traditional approaches.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
May_2024 Top 10 Read Articles in Computer Networks & Communications.pdfIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
April 2024 - Top 10 Read Articles in Computer Networks & CommunicationsIJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF Based Intrusion Detection System for Big Data IOT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
A Novel Medium Access Control Strategy for Heterogeneous Traffic in Wireless ...IJCNCJournal
So far, Wireless Body Area Networks (WBANs) have played a pivotal role in driving the development of intelligent healthcare systems with broad applicability across various domains. Each WBAN consists of one or more types of sensors that can be embedded in clothing, attached directly to the body, or even implanted beneath an individual's skin. These sensors typically serve asingle application. However, the traffic generated by each sensor may have distinct requirements. This diversity necessitates a dual approach: tailored treatment based on the specific needs of each traffic typeand the fulfillment of application requirements, such asreliability and timeliness. Never the less, the presence of energy constraints and the unreliable nature of wireless communications make QoS provisioning under such networks a non-trivial task. In this context, the current paper introduces a novel Medium AccessControl (MAC) strategy for the regular traffic applications of WBANs, designed to significantly enhance efficiency when compared to the established MAC protocols IEEE 802.15.4 and IEEE 802.15.6, with a particular focus on improving reliability, timeliness, and energy efficiency.
A Topology Control Algorithm Taking into Account Energy and Quality of Transm...IJCNCJournal
The efficient use of energy in wireless sensor networks is critical for extending node lifetime. The network topology is one of the factors that have a significant impact on the energy usage at the nodes and the quality of transmission (QoT) in the network. We propose a topology control algorithm for software-defined wireless sensor networks (SDWSNs) in this paper. Our method is to formulate topology control algorithm as a nonlinear programming (NP) problem with the objective to optimizing two metrics, maximum communication range, and desired degree. This NP problem is solved at the SDWSN controller by employing the genetic algorithm (GA) to determine the best topology. The simulation results show that the proposed algorithm outperforms the MaxPower algorithm in terms of average node degree and energy expansion ratio.
Multi-Server user Authentication Scheme for Privacy Preservation with Fuzzy C...IJCNCJournal
The integration of artificial intelligence technology with a scalable Internet of Things (IoT) platform facilitates diverse smart communication services, allowing remote users to access services from anywhere at any time. The multi-server environment within IoT introduces a flexible security service model, enabling users to interact with any server through a single registration. To ensure secure and privacy preservation services for resources, an authentication scheme is essential. Zhao et al. recently introduced a user authentication scheme for the multi-server environment, utilizing passwords and smart cards, claiming resilience against well-known attacks. This paper conducts cryptanalysis on Zhao et al.'s scheme, focusing on denial of service and privacy attacks, revealing a lack of user-friendliness. Subsequently, we propose a new multi-server user authentication scheme for privacy preservation with fuzzy commitment over the IoT environment, addressing the shortcomings of Zhao et al.'s scheme. Formal security verification of the proposed scheme is conducted using the ProVerif simulation tool. Through both formal and informal security analyses, we demonstrate that the proposed scheme is resilient against various known attacks and those identified in Zhao et al.'s scheme.
Advanced Privacy Scheme to Improve Road Safety in Smart Transportation SystemsIJCNCJournal
In -Vehicle Ad-Hoc Network (VANET), vehicles continuously transmit and receive spatiotemporal data with neighboring vehicles, thereby establishing a comprehensive 360-degree traffic awareness system. Vehicular Network safety applications facilitate the transmission of messages between vehicles that are near each other, at regular intervals, enhancing drivers' contextual understanding of the driving environment and significantly improving traffic safety. Privacy schemes in VANETs are vital to safeguard vehicles’ identities and their associated owners or drivers. Privacy schemes prevent unauthorized parties from linking the vehicle's communications to a specific real-world identity by employing techniques such as pseudonyms, randomization, or cryptographic protocols. Nevertheless, these communications frequently contain important vehicle information that malevolent groups could use to Monitor the vehicle over a long period. The acquisition of this shared data has the potential to facilitate the reconstruction of vehicle trajectories, thereby posing a potential risk to the privacy of the driver. Addressing the critical challenge of developing effective and scalable privacy-preserving protocols for communication in vehicle networks is of the highest priority. These protocols aim to reduce the transmission of confidential data while ensuring the required level of communication. This paper aims to propose an Advanced Privacy Vehicle Scheme (APV) that periodically changes pseudonyms to protect vehicle identities and improve privacy. The APV scheme utilizes a concept called the silent period, which involves changing the pseudonym of a vehicle periodically based on the tracking of neighboring vehicles. The pseudonym is a temporary identifier that vehicles use to communicate with each other in a VANET. By changing the pseudonym regularly, the APV scheme makes it difficult for unauthorized entities to link a vehicle's communications to its real-world identity. The proposed APV is compared to the SLOW, RSP, CAPS, and CPN techniques. The data indicates that the efficiency of APV is a better improvement in privacy metrics. It is evident that the AVP offers enhanced safety for vehicles during transportation in the smart city.
DEF: Deep Ensemble Neural Network Classifier for Android Malware DetectionIJCNCJournal
Malware is one of the threats to security of computer networks and information systems. Since malware instances are available sufficiently, there is increased interest among researchers on usage of Artificial Intelligence (AI). Of late AI-enabled methods such as machine learning (ML) and deep learning paved way for solving many real-world problems. As it is a learning-based approach, accumulated training samples help in improving thequality of training and thus leveraging malware detection accuracy. Existing deep learning methods are focusing on learning-based malware detection systems. However, there is need for improving the state of the art through ensemble approach. Towards this end, in this paper we proposed a framework known as Deep Ensemble Framework (DEF) for automatic malware detection. The framework obtains features from training samples. From given malware instance a grayscale image is generated. There is another process to extract the opcode sequences. Convolutional Neural Network (CNN) and Long Short Term Memory (LSTM) techniques are used to obtain grayscale image and opcode sequence respectively. Afterwards, a stacking ensemble is employed in order to achieve efficient malware detection and classification. Malware samples collected fromthe Internet sources and Microsoft are used for theempirical study. An algorithm known as Ensemble Learning for Automatic Malware Detection (EL-AML) is proposed to realize our framework. Another algorithm named Pre-Process is proposed to assist the EL-AML algorithm for obtaining intermediate features required by CNN and LSTM.Empirical study reveals that our framework outperforms many existing methods in terms of speed-up and accuracy.
High Performance NMF based Intrusion Detection System for Big Data IoT TrafficIJCNCJournal
With the emergence of smart devices and the Internet of Things (IoT), millions of users connected to the network produce massive network traffic datasets. These vast datasets of network traffic, Big Data are challenging to store, deal with and analyse using a single computer. In this paper we developed parallel implementation using a High Performance Computer (HPC) for the Non-Negative Matrix Factorization technique as an engine for an Intrusion Detection System (HPC-NMF-IDS). The large IoT traffic datasets of order of millions samples are distributed evenly on all the computing cores for both storage and speedup purpose. The distribution of computing tasks involved in the Matrix Factorization takes into account the reduction of the communication cost between the computing cores. The experiments we conducted on the proposed HPC-IDS-NMF give better results than the traditional ML-based intrusion detection systems. We could train the HPC model with datasets of one million samples in only 31 seconds instead of the 40 minutes using one processor), that is a speed up of 87 times. Moreover, we have got an excellent detection accuracy rate of 98% for KDD dataset.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
IoT Guardian: A Novel Feature Discovery and Cooperative Game Theory Empowered...IJCNCJournal
Cyber intrusion attacks increasingly target the Internet of Things (IoT) ecosystem, exploiting vulnerable devices and networks. Malicious activities must be identified early to minimize damage and mitigate threats. Using actual benign and attack traffic from the CICIoT2023 dataset, this WORK aims to evaluate and benchmark machine-learning techniques for IoT intrusion detection. There are four main phases to the system. First, the CICIoT2023 dataset is refined to remove irrelevant features and clean up missing and duplicate data. The second phase employs statistical models and artificial intelligence to discover novel features. The most significant features are then selected in the third phase based on cooperative game theory. Using the original CICIoT2023 dataset and a dataset containing only novel features, we train and evaluate a variety of machine learning classifiers. On the original dataset, Random Forest achieved the highest accuracy of 99%. Still, with novel features, Random Forest's performance dropped only slightly (96%) while other models achieved significantly lower accuracy. As a whole, the work contributes substantial contributions to tailored feature engineering, feature selection, and rigorous benchmarking of IoT intrusion detection techniques. IoT networks and devices face continuously evolving threats, making it necessary to develop robust intrusion detection systems.
** Connect, Collaborate, And Innovate: IJCNC - Where Networking Futures Take ...IJCNCJournal
The International Journal of Computer Networks & Communications (IJCNC) is a bi monthly open access peer-reviewed journal that publishes articles which contribute new results in all areas of Computer Networks & Communications. The journal focuses on all technical and practical aspects of Computer Networks & data Communications. The goal of this journal is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
Enhancing Traffic Routing Inside a Network through IoT Technology & Network C...IJCNCJournal
IoT networking uses real items as stationary or mobile nodes. Mobile nodes complicate networking. Internet of Things (IoT) networks have a lot of control overhead messages because devices are mobile. These signals are generated by the constant flow of control data as such device identity, geographical positioning, node mobility, device configuration, and others. Network clustering is a popular overhead communication management method. Many cluster-based routing methods have been developed to address system restrictions. Node clustering based on the Internet of Things (IoT) protocol, may be used to cluster all network nodes according to predefined criteria. Each cluster will have a Smart Designated Node. SDN cluster management is efficient. Many intelligent nodes remain in the network. The network design spreads these signals. This paper presents an intelligent and responsive routing approach for clustered nodes in IoT networks. An existing method builds a new sub-area clustered topology. The Nodes Clustering Based on the Internet of Things (NCIoT) method improves message transmission between any two nodes. This will facilitate the secure and reliable interchange of healthcare data between professionals and patients. NCIoT is a system that organizes nodes in the Internet of Things (IoT) by grouping them together based on their proximity. It also picks SDN routes for these nodes. This approach involves selecting one option from a range of choices and preparing for likely outcomes problem addressing limitations on activities is a primary focus during the review process. Predictive inquiry employs the process of analyzing data to forecast and anticipate future events. This document provides an explanation of compact units. The Predictive Inquiry Small Packets (PISP) improved its backup system and partnered with SDN to establish a routing information table for each intelligent node, resulting in higher routing performance. Both principal and secondary roads are available for use. The simulation findings indicate that NCIoT algorithms outperform CBR protocols. Enhancements lead to a substantial 78% boost in network performance. In addition, the end-to-end latency dropped by 12.5%. The PISP methodology produces 5.9% more inquiry packets compared to alternative approaches. The algorithms are constructed and evaluated against academic ones.
Immunizing Image Classifiers Against Localized Adversary Attacksgerogepatton
This paper addresses the vulnerability of deep learning models, particularly convolutional neural networks
(CNN)s, to adversarial attacks and presents a proactive training technique designed to counter them. We
introduce a novel volumization algorithm, which transforms 2D images into 3D volumetric representations.
When combined with 3D convolution and deep curriculum learning optimization (CLO), itsignificantly improves
the immunity of models against localized universal attacks by up to 40%. We evaluate our proposed approach
using contemporary CNN architectures and the modified Canadian Institute for Advanced Research (CIFAR-10
and CIFAR-100) and ImageNet Large Scale Visual Recognition Challenge (ILSVRC12) datasets, showcasing
accuracy improvements over previous techniques. The results indicate that the combination of the volumetric
input and curriculum learning holds significant promise for mitigating adversarial attacks without necessitating
adversary training.
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Industrial Training at Shahjalal Fertilizer Company Limited (SFCL)MdTanvirMahtab2
This presentation is about the working procedure of Shahjalal Fertilizer Company Limited (SFCL). A Govt. owned Company of Bangladesh Chemical Industries Corporation under Ministry of Industries.
Cosmetic shop management system project report.pdfKamal Acharya
Buying new cosmetic products is difficult. It can even be scary for those who have sensitive skin and are prone to skin trouble. The information needed to alleviate this problem is on the back of each product, but it's thought to interpret those ingredient lists unless you have a background in chemistry.
Instead of buying and hoping for the best, we can use data science to help us predict which products may be good fits for us. It includes various function programs to do the above mentioned tasks.
Data file handling has been effectively used in the program.
The automated cosmetic shop management system should deal with the automation of general workflow and administration process of the shop. The main processes of the system focus on customer's request where the system is able to search the most appropriate products and deliver it to the customers. It should help the employees to quickly identify the list of cosmetic product that have reached the minimum quantity and also keep a track of expired date for each cosmetic product. It should help the employees to find the rack number in which the product is placed.It is also Faster and more efficient way.
Final project report on grocery store management system..pdfKamal Acharya
In today’s fast-changing business environment, it’s extremely important to be able to respond to client needs in the most effective and timely manner. If your customers wish to see your business online and have instant access to your products or services.
Online Grocery Store is an e-commerce website, which retails various grocery products. This project allows viewing various products available enables registered users to purchase desired products instantly using Paytm, UPI payment processor (Instant Pay) and also can place order by using Cash on Delivery (Pay Later) option. This project provides an easy access to Administrators and Managers to view orders placed using Pay Later and Instant Pay options.
In order to develop an e-commerce website, a number of Technologies must be studied and understood. These include multi-tiered architecture, server and client-side scripting techniques, implementation technologies, programming language (such as PHP, HTML, CSS, JavaScript) and MySQL relational databases. This is a project with the objective to develop a basic website where a consumer is provided with a shopping cart website and also to know about the technologies used to develop such a website.
This document will discuss each of the underlying technologies to create and implement an e- commerce website.
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
Hierarchical Digital Twin of a Naval Power SystemKerry Sado
A hierarchical digital twin of a Naval DC power system has been developed and experimentally verified. Similar to other state-of-the-art digital twins, this technology creates a digital replica of the physical system executed in real-time or faster, which can modify hardware controls. However, its advantage stems from distributing computational efforts by utilizing a hierarchical structure composed of lower-level digital twin blocks and a higher-level system digital twin. Each digital twin block is associated with a physical subsystem of the hardware and communicates with a singular system digital twin, which creates a system-level response. By extracting information from each level of the hierarchy, power system controls of the hardware were reconfigured autonomously. This hierarchical digital twin development offers several advantages over other digital twins, particularly in the field of naval power systems. The hierarchical structure allows for greater computational efficiency and scalability while the ability to autonomously reconfigure hardware controls offers increased flexibility and responsiveness. The hierarchical decomposition and models utilized were well aligned with the physical twin, as indicated by the maximum deviations between the developed digital twin hierarchy and the hardware.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
MULTI-CONSTRAINTS ADAPTIVE LINK QUALITY INDEX BASED MOBILE-RPL ROUTING PROTOCOL FOR LOW POWER LOSSY NETWORKS
1. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
DOI: 10.5121/ijcnc.2018.10503 41
MULTI-CONSTRAINTS ADAPTIVE LINK QUALITY
INDEX BASED MOBILE-RPL ROUTING PROTOCOL
FOR LOW POWER LOSSY NETWORKS
Sneha K1
. and B G Prasad2
1
Department of Computer Science & Engineering, BNM Institute of Technology,
Bengaluru, Karnataka, India
2
Department of Computer Science & Engineering, BMS College of Engineering,
Bengaluru, Karnataka, India
ABSTRACT
The importance of IPv6 Routing Protocol for Low power and Lossy Networks (LLNs), also called RPL, has
motivated in the development of a robust and quality of service (QoS) oriented Multi-Constraints Adaptive
Link Quality Index (MALQI) based routing protocol. Unlike classical RPL protocols, MALQI enables
mobile-RPL while ensuring fault-resilient, reliable and QoS communication over LLNs. MALQI protocol
exploits key novelties such as signal strength based mobile node positioning, average received signal
strength indicator (ARSSI) and ETX based objective function for fault tolerant best forwarding path
selection. The functional architecture of MALQI enables it to be used as the parallel to the link layer RPL
that even in the case of link failure can assist efficient data delivery over LLNs. Once detecting link outage,
MALQI can execute node discover and best forwarding path selection to assist QoS delivery. Contiki-Cooja
based simulation reveals that MALQI based mobile-RPL outperforms other state-of-art routing protocols.
KEYWORDS
Mobile-RPL; Adaptive Link Quality; Low Power Lossy Network; Routing Protocol; MALQI.
1. INTRODUCTION
The high pace emergence of wireless communication and associated applications has motivated
academia- industries to develop more efficient and Quality of Service (QoS) enabling
communication solutions. Among major at-hand networking solutions, Wireless Sensor Network
(WSN) is found a better candidate because of its decentralized and infrastructure fewer
characteristics. WSN is one of the most used communication systems that serve an array of
applications including surveillance systems, industrial monitoring, and control, wireless
broadcast, defense purposes, traffic surveillance etc. In recent years efforts have been made to
introduce mobility with WSN. Introducing mobility in WSN forces network to undergo various
adverse situations such as topological changes, congestion, network contention, data drop,
retransmission, end-to-end delay, increased latency and energy exhaustion. The situation turns out
to be more severe in case of the lossy environment.
In last few years, numerous research efforts have been made to enhance WSN routing protocols
[1-5]; however major efforts either intend to deal with energy enhancement, delay sensitive
communication or throughput optimization. However, realizing present day application specific
demands (i.e., IoT applications and other communication systems operating under LLN
conditions) and QoS, the majorities of the traditional approaches either fail to deliver
anticipations or provides single performance parameter optimization. To alleviate existing
limitations, recently a routing protocol named Routing Protocol for Low Power Lossy network
(RPL) was proposed by Internet Engineering Task Force (IETF) in 2008 [6]. RPL is recognized
for its efficacy to enhance performance for LLN applications [7]. Typically, LLNs are defined in
2. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
42
terms of high packet loss, path loss, channel fading, multi-path interferences, low connectivity,
low power equipment, etc. Practically, WSN is one of the key examples of LLNs. Considering the
significance of RPL a few efforts have been made to use it for LLN applications. Native RPL [6],
doesn’t have mobility features, and hence to meet the exponentially rising demands mobility
aware routing protocol is inevitable. With intend to introduce mobility with RPL a few efforts are
made in [8][9]; however, most of the approaches undergo link instability and responsiveness
issues due to dynamic topology and network parameters. To ensure the higher performance of a
routing model, deciding the best forwarding node (BFN) often plays the vital role. Authors have
applied expected number of (control) packet transmission (ETX) as the objective function to
perform RPL parent node selection (i.e., resulting the best forwarding path selection). The
inefficient BFN selection often results into data drop, delay, and energy exhaustion. On contrary,
there are numerous applications where LLN are expected to provide QoS and QoE delivery in a
stringent manner while ensuring higher packet delivery ratio (PDR) and low delay. Such
expectations might be even at the coarser level or at a fine grain packet level. Applications like
threshold crossing alerts, fault or intrusion identification, event detection, burglar alarms,
industrial supervision and automation-control, remote healthcare monitoring etc demand higher
degree of QoS provision. For example, RPL based healthcare monitoring over LLN signifies a
tedious task where there can be mobility of the person whose medical parameters, like
electrocardiogram (ECG), pulse rate, temperature etc are being remotely monitored. In such
scenarios, the data rates of the order of multiples Kbps may be anticipated to perform health
monitoring. IEEE 802.15.4 MAC, a typically applied link layer protocol in RPL-LLNs possesses
a built-in ACK mechanism to reduce packet loss during link outage by means of retransmissions.
In practice, the highest retransmission count is set-up as 4-5 while retransmission is scheduled at
the interval of 10ms. Though it exhibits retransmission well for the transient link outages for the
small duration, it is unable to avoid or stop unsuccessful packet transmission, particularly when
the wireless channel has significantly high coherence times or receiver node failures.
Considering the significance of link reliability and dynamic link assessment-based routing, in our
previous work, a novel hand-off optimization based best forwarding path selection and routing
model was developed. Though, the use of multiple timers and adaptive path selection
strengthened our mobile-RPL routing to exhibit higher PDR; however, at the cost of increased
control traffic overheads. The increased overhead was due to multiple timers. To alleviate those
limitations, in this paper a Multi-constraints Adaptive Link Quality Index (MALQI) model is
developed for the best parent node selection and thus the best forwarding path formation over
mobility based RPL. MALQI applies ETX as the RPL objective function and additionally uses
adaptive RSSI of a node to decide best parent node. In addition, we apply an adaptive RSSI based
mobile node positioning measure to strengthen fault-resiliency and reliability. Unlike existing
works, where merely default objective function (OF0) are used or expected number of control
packet transmission is applied to decide best forwarding path, our proposed MALQI model
applies both the adaptive RSSI of the RPL node and ETX that itself is directly related to PDR.
Here, the prime motive was to use these two constraints so as to enable reliable best forwarding
path formation (i.e., alternative path formation for packet delivery during link-outage conditions).
In fact, the proposed MALQI model operates as a parallel functioning unit of link layer where
once detecting link-outage it executes node discovery and selects best parent set to form a best
forwarding path. In addition, RSSI adaptive mobile node positioning model strengthens our
proposed model to ensure fault-resilient communication. Thus, the proposed model can be stated
as a link-adaptive routing model where the emphasis is made on enabling link-outage resilient
routing decision for higher PDR, low delay, low energy consumption etc. The other sections of
the presented paper are divided as follows: Section 2 presents the related works, Section 3 briefs
about RPL protocol and key terminologies. It is then followed by problem formulation in Section
4 and proposed model discussion in Section 5. Results obtained are discussed in Section 6. The
overall research conclusion and future scopes are discussed in Section 7, and the references used
in this manuscript are presented at the end of the paper.
3. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
43
2. RELATED WORK
This section briefs some of the key literature presenting RPL routing protocol and associated best
forwarding node selection mechanism. Some of the literature discussing mobility based RPL are
also discussed. Considering transient link adaptive path selection, Tsiftes et al. [10] observed that
a number of data packets are lost during the selection of an alternate parent. Authors stated that
with the increase in payloads, hop-counts, mobility and resulting topological variations cause
high data loss. Authors [11] applied opportunistic routing protocol for RPL path selection where
to enhance reliability and delay they performed transmissions over multiple paths in addition to
the native RPL parent-based transmission. A similar effort was made by Duquennoy et al. [12]
who exploited an opportunistic routing model for any type of traffic condition. However, authors
could not state that how the paths considered by packets fulfill path metric according to the RPL
Objective Function (OF).
Considering the significance of mobility with RPL, few efforts have been made [8] [13-17][20-
23]. Hong et al. in [13] developed a mobility based RPL routing protocol. In their routing model
they broadcasted DIO messages containing node rank and link quality index based on which that
built DAGs. It enables mobile nodes to identify multiple paths, as an alternative to the failed
route. To enable swift local repair, authors used sibling nodes into the route table of the individual
RPL node; and in case there is no sibling node available, the node identifying certain broken link
can execute global repair. It is performed by the sink, which rebuilds a new DODAG to continue
data transmission. To enable swift path formation for data transmission over RPL, Lee et al. [8]
derived a transient ETX probing scheme. This approach estimates ETX once finding any new
neighbor node and thus builds DIOs and DAOs accordingly (based on the new parent election).
This process avoids waiting time for the trickle timer. In addition, they suggested a loop detection
and avoidance measure using stamping of the DIO messages with its parent’s ID.
Safdar et al. [14] developed mobile a sink-based data collection model, where mobility was
controlled in such a way that it moves towards nodes possessing higher energy. It enabled load
balancing and avoided network partitioning too. A similar effort was made by Saad et al. [15]
who assessed RPL with two different application scenarios, first with mobile sink and second
with low-power Power Line Communication (PLC). Authors applied sink movement to avoid
retransmission and energy consumption. They made a similar effort in [16] where they applied
sink mobility to reduce energy consumption. The key limitation of their model was that it focused
only on energy consumption. On the contrary, maintaining higher QoS and QoE is vital for major
LLNs applications. In [16], Saad et al. examined sinks mobility in RPL and revealed that sinks
mobility can be the potential design criteria; however, it is more effective only for achieving
enhanced network lifetime. Authors applied a distributed and weighted moving mechanism for
sink mobility in RPL. With intend to reduce the control traffic in RPL network Korbi et al. [17]
suggested maintaining lower reactivity to the topological variations. Authors performed mobile
node identification and RPL enhancement to achieve better performance. Korbi et al. [17]
examined the issue of mobility with RPL over WSN, where to reduce control traffic overhead
they performed mobile node identification. It was found vital for efficient path formation and
transmission decision. In their other research [17], they derived a dynamic DIS management
model for mobility based RPL. In their approach, a condition where a mobile node does not
execute new DIO because of rank value also functions by using ETX as the RPL objective
function.
Tripathi et al. [18] derived an RPL routing protocol using OMNET++ where they considered
ETX as BFN matrix to build the DAG. They found that ETX based route formation can
significantly reduce the global repair time and control traffic requirements. Tsiftes et al. [19]
examined the performance of the RPL protocol to be used for smart grid applications. Performing
4. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
44
simulation over OMNET++ they illustrated that trickle timer impacts RPL routing performance,
particularly control traffic overhead. Authors stated that the efficiently scheduled trickle timers
can reduce latency. Kharrufa et al. [20] introduced mobility with RPL routing protocol for the
dynamic network. Authors derived a controlled reverse-trickle timer using RSSI measurements to
maintain high network responsiveness and minimum overhead. Based on topological
inconsistency, node rebuilds its DODAG to schedules transmission.
Recently, an enhanced RPL routing model called Co-RPL was developed by Gaddour et al. [21]
where to incorporate mobility with the RPL, authors exploited the concept of Corona. To examine
the efficiency of Co-RPL, authors applied Contiki/Cooja simulation environment. They found
CoRPL better than the native RPL. Somaa et al. [22] to derive mobility based RPL proposed an
enhanced protocol named Bayesian model Mobility Prediction RPL for LLN application. To
achieve it authors performed node identification, node velocity estimation and link duration. This
information as cumulative metrics enables efficient forwarding route decision. To provide a
reliable RPL routing protocol, Barcelo et al. [23] incorporated Kalman positioning RPL (KP-
RPL) for WSN. Authors used both static and mobile nodes to form WSN. The prime novelty of
KP-RPL model is its efficiency to obtain accurate positioning details for routing decision. Safdar
et al. [14] derived a hybrid routing protocol using reactive and proactive mechanism to enhance
native RPL with mobile sinks. They found their approach better for handling multiple sink
mobility in WSNs. To achieve high PDR, Lohith et al. [24] developed lightweight add-on
functionality to strengthen RPL’s network layer's data forwarding process. Realizing the impact
of trickle timers on control traffic overheads, Lee et al. [25] eliminated the trickle algorithm for
DIO and substituted it with the fixed interval ranging from 2s to 10s. These literatures reveal that
no doubt a few efforts have been made to enhance mobile-RPL for LLNs; however, the scope for
further optimization, particularly for fault-resilient best forwarding path estimation, best parent
set selection in the mobile network, etc can’t be ignored. This research intends to derive a more
computationally efficient and robust mobile-RPL routing protocol for emerging QoS/QoE
oriented IoT ecosystems.
3. RPL: AN OVERVIEW
Before discussing the implementation of the proposed Multi-Constraints Link Quality Index
(MALQI) based mobile-RPL routing protocol, understanding RPL routing is vital. This section
briefs about RPL protocol.
Typically, the RPL [6] protocol is stated to be a type of pro-active routing mechanism developed
for data transmission over LLNs. RPL operates on the basis of the topological concept of
Directed Acyclic Graphs (DAGs). RPL functions by applying three network attributes, DAG
Information Solicitation (DIS), DAG Information Object (DIO) and Destination Advertisement
Object (DAO) based on which it builds a Destination Oriented Directed Acyclic Graph
(DODAG) for data transmission. Here, DAG represents a tree structure that characterizes the
default routes in LLNs. The fundamental topological element in RPL is DODAG, which is rooted
at a specific node called DODAG root. RPL can have multiple DODAGs that can be
characterized in terms of the following parameters:
a) DODAGID: It represents DODAG root.
b) RPLInstanceID: It identifies an autonomous set of DODAGs that can be enhanced for
certain specific conditions.
c) DODAGVersionNumber: It increments certain specific events, such as the
reconstruction of a DODAG.
5. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
45
d) Rank: It represents the node position with regard to the root node in a DODAG. In
DODAG, each node is assigned a rank that typically increases in the downstream
direction of the DAG and vice versa.
3.1 RPL control messages
The RPL control messages are a type of Internet Control Message Protocol version 6
(ICMPv6) (RFC 2463). There are four types of control messages in RPL. These are:
a) DODAG Information Object (DIO): It is issued by DODAG root to form a new DAG,
which is then followed by multicast transmission through DODAG structure. It carries
significant network information that permits a node to perform RPL instance discovery,
extracting structural parameters, selecting a DODAG parent set, and maintaining the
DODAG structure.
b) DODAG Information Solicitation (DIS): It detects neighbour nodes in adjoining
DODAGs.
c) Destination Advertisement Object (DAO): It broadcasts reverse-route information
(RRIs) to trace the nodes visited along the upward path. Usually, it is transmitted by each
node, except the DODAG root to proliferate the routing tables containing prefixes of their
children nodes.
d) Destination Advertisement Object Acknowledgment (DAO-ACK): It is transmitted in
terms of a unicast packet by a DAO recipient who sends a unicast DAO message as the
reply.
The rank information is embedded or routed in DIO in such way that the nodes located farther
from the root node would have higher ranks than the near ones. It avoids any looping problem in
the network. In DODAG formation RPL applies Objective Function (OF) that decides route
selection to achieve targeted anticipation such as high PDR, low, latency and low energy
consumption. Typically, OF0 and the expected transmission count (ETX) are used as the OF path
metric to estimate node rank with regard to root. As stated above, DIO control message is used to
build the upward routes (i.e., from a node to the root). On the other hand, DAO control messages
are transmitted from the child nodes to their respective parent node so as to build the downward
routes (i.e., from route to the node). DIO message scheduling is performed based on trickle timer
[26]. Functionally, trickle timer plays the vital role in RPL such as, it enables swift network
convergence while ensuring that the control messages do not over-burden the network. In case of
the stable network (i.e., there is no network change) trickle timer increases exponentially so that
the re-configuration overheads incurred during topological changes might be reduced. Once
detecting any network topological change, trickle timer is reset and network discovery is
executed. To join a network, a node requires sending DIS message to advertise its presence in the
network.
4 .PROBLEM FORMULATION
As stated above, enabling best forwarding path selection is vital to ensure reliable and efficient
communication over mobile-RPL based LLNs. In mobile-RPL the predominant issue of
continuous topological variations and resulting link-outage probability that consequently affects
overall network performance. To deal with such adversaries and enable reliable communication
with low latency, major existing approaches prefer applying multipath forwarding strategies by
performing packet-replication over different links. Though, such an approach could bring about
low latency and network convergence, however ensuring link-outage intact remains an open
question. In addition, such approaches require significantly high traffic control signals and hence
impose computational overheads and energy consumption. Additionally, it can cause
6. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
46
unpredictable communication among existing RPL DODAG (nodes) that can make network
management and routing a complex task. Major existing mobile-RPL routing approaches apply
default objective function (OF0) for DODAG formation or forwarding path selection. However,
the exceedingly varying network topologies and associated parameter changes, such as signal to
noise ratio (i.e., received signal strength index (RSSI)) etc do have impact on link-reliability and
performance. To deal with such adversaries, multiple timers and average RSSI based approach
can be derived for best forwarding path selection; however, inclusion of multiple timers;
connectivity timer, topology aware mobility detection timer, data exchange and hand-off timer,
response timer for reliability oriented handoff optimization introduced computational overheads.
As already stated, in mobile-RPL due to dynamic change in topology and network parameters,
link-outage become a common threat. To deal with such adversaries, RPL contains two types of
link-outage repair model, global and local link repair schemes. The global repair model is
executed by the root node where the overall network is re-constructed through a modified
DODAG to further re-build the entire network. On the other hand, link level local repair is
executed when a parent node undergoes failure. To enable fault-resilient and QoS sensitive
transmission, once detecting failure of a parent node an alternate parent can be selected from the
parent set table. In case there is no alternate parent node available, node can behave as a new
node and can broadcast DIS message. However, link-outage and its consequences leads
significant control message overheads, latency, energy consumption, and most significantly low
PDR. It significantly put question over the efficacy of the proposed routing model. On the other
hand, in case of mobility based RPL undergoes significant changes in topology and hence the
link-outage probability can’t be ignored. Therefore, to avoid performance degradation, especially
reliability of the mobile-RPL network, applying a robust and efficient best forwarding path is of
utmost significance. With this motivation, in this research paper we have developed a robust
Multi-Constraints Adaptive Link Quality Index (MALQI) based best forwarding path selection
model has been developed for mobile-RPL routing protocol.
Realizing the significant limitations or fault-proneness of multipath transmission mechanism over
dynamic network topology, it is inevitable to obtain best parent node and the best forwarding
path. To achieve it, in this paper a novel link outage resilient MALQI model is developed that
functions in parallel to the link layer of the RPL nodes. Once detecting any link outage MALQI is
executed that applies ETX as well as adaptive RSSI to estimate best parent node to re-build
alternative link so as to ensure reliable data transmission. To achieve it, a backup of the data
being transmitted is maintained which is transmitted through alternate best forwarding path (with
the help of best parent node) towards destination. Realizing the resource constrained
communication, once receiving acknowledgment from the sink, the buffer storing backup data
can be flush to accommodate packet during future outage condition. Here, it should be noted that
MALQI can operate in parallel to the network layer and the parent nodes in the table can be
ordered based on path metrics (i.e., ETX and Adaptive RSSI). In proposed model, the alternate
parent selection process (to build best forwarding path) continues iterating based on available
resource constraints and QoS demands. One of the key parameter that affects the overall
performance is the MAC retransmission limit that decides when to execute node discovery for
best parent node selection and best forwarding path formation. In addition, the estimation of
adaptive RSSI and its use for PDR estimation, which is later used to decide ETX makes proposed
model robust enough to ensure link-outage resilient and reliable communication. Here, higher
RSSI signifies higher PDR and hence QoS assurance. Thus, consideration of PDR for ETX
decision makes our proposed routing model strong enough to build link-outage resilient path for
communication using mobile-RPL over LLNs. In addition, for a pre-defined timeout delay
between retransmissions, a relatively lesser retransmission limit can compel node to impulsively
run off from the current parent to identify a parent with relatively low link quality. On the
contrary, higher retransmission limit can force node to continue with the parent undergoing link
7. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
47
outage even for the long time. In our research model parent node are selected as per native RPL
model where it contains the parent nodes allied with each DODAG. Here, parent nodes are
ordered in decreasing order of their respective path metrics, estimated by means of ETX objective
function. In addition to the above-mentioned approaches, the implementation of RSSI adaptive
mobile node positioning can be of paramount significance to enable timely (i.e., delay resilient)
data gathering and reliable transmission over LLNs.
5. PROPOSED MODEL
This section briefs our proposed Multi-Constraints Adaptive Link Quality Index (MALQI) based
link-outage resilient best parent node selection and the best forwarding path formation approach
for mobile-RPL to be used in LLNs. As stated in previous sections, once detecting any link-
outage or failure in delivering the packet to the parent node, MALQI which operates in parallel to
the network layer enables forwarding the same data packet to the defined parent node. It is
achieved by identifying best forwarding path with the help of parent node (in the same DODAG)
ordered with respective path metrics. In our proposed approach, the node discovery is initiated
only after getting link-outage adversary. The best parent node selection-oriented node discovery
continues iterating to identify best forwarding node based on respective resource constraints and
QoS sensitive demands (i.e., higher PDR and link reliability). One of the contributions is that the
proposed MALQI routing model maintains backward-compatibility with the native RPL routing
scheme. Unlike major existing approaches where either ETX or OF0 is used as RPL objective
function for best parent node selection, in this paper multiple constraints including ETX and
adaptive RSSI of a node are considered for the best parent node selection. Since higher RSSI
signifies higher PDR that itself is related to the ETX count and hence dynamic measurement of
RSSI of a node and applying it to derive ETX for best path selection makes our proposed model
robust to avoid any link outage probability. As already stated MALQI operates in parallel to the
network layer of the RPL node and hence once detecting any link outage it is executed that
further initiates node discovery to identify best parent node from parent set table. In our proposed
model, based on respective path metrics a list of parent nodes are stored pro-actively in parent
table. The parent table maintains the parent nodes related to each DODAG, where each parent
node is ordered in the decreasing order of its path metrics (i.e., ETX and Adaptive RSSI). It
enables the swift path decision to achieve better performance. In our proposed model, in case
MALQI doesn’t find any parent node in parent set table it executes node discovery, which is then
followed by the formation of the best forwarding path (as the alternate path for data
transmission).
Considering the overall operating model for the proposed MALQI based IP layer packet
forwarding path is depicted in Fig. 1. In this figure IP layer, its interface with the link layer and
RPL can be visualized precisely
.
8. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
48
Fig. 1. MALQI based packet forwarding in mobile-RPL
Realizing the significance of node positioning and respective routing decision, in this paper, we
have derived RSSI based mobile node localization. Since MALQI exploits the adaptive RSSI
value of each RPL node and hence using it for node positioning is not an intricate task. The
discussion of the RSSI based node localization is presented in the following sub-sections.
Meanwhile, since the proposed LLN environment comprises both the static nodes (i.e., access
points or the anchor nodes) as well as the mobile node, and hence discussing inter-node
communication is must. The following sub-section briefs about the node positioning and inter-
node communication in the proposed routing protocol.
5.1 System Model
For any communication system node deployment and its optimal localization play a vital role in
ensuring higher performance. Unlike random node deployment we have incorporated a
confidence region-based node positioning; however, the proposed MALQI based mobile-RPL
protocol can function with any network topology. A brief of the applied LLNs node positioning
model is presented as follows:
5.1.1 Node Positioning
In targeted LLNs the static nodes, usually called anchor nodes are placed in such way that the
node location doesn’t contain error. This, as a result, can enable swift network parameter
estimation, decision process and forwarding path selection. Considering mobility across the
network, estimating the location of the mobile node is vital to ensure optimal performance and
QoS delivery over LLNs. For example, with an application specific scenario when a mobile sink
intends to collect data for further processing or decision process, it requires collecting data timely
and reliably. In such circumstances the dynamic positioning of the mobile node (in conjunction
with best forwarding node or parent node selection) is the must. To achieve it, the mobile node
can consider RSSI of an anchor node as the parameter to decide whether to move towards that for
link formation or not. In our proposed localization model, the mobile node positioning is
performed by considering the adaptive or dynamic RSSI value of an anchor node. This section
briefs about the localization of nodes across the network and respective routing decision (routing
decision for inter-static or inter-anchor routing decision and mobile to anchor routing decision).
9. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
49
5.1.2 Confidence Region (CR) based Node Localization
This section primarily discusses the mobile node positioning under a mobility condition. In our
research, we use dynamic RSSI of an anchor node to perform mobile node positioning. The prime
reason of the selection of this method is that unlike other approaches (for example, least square),
it estimates and characterizes the impact of each static or anchor node distinctly. In addition, the
RSSI estimates from nearer static nodes influences node positioning significantly in comparison
to those estimated from distant static nodes. To create CR, we consider that the mobile nodes are
aware of the time-varying channel statistics follows the long-distance path loss model. Here,
RSSI at certain instant (say, Kth
time slot) is obtained as equation (1).
(1)
Where P1m refers the received signal at a pre-defined distance (here, 1 meter from the source), α
refers the path-loss exponent, the transmission range is d while, signifies zero mean
Gaussian noise. The derived expression for the distance between the mobile and the static node
using RSSI is given in equation (2).
(2)
Here, it must be noted that avoids following a Gaussian distribution because of the
exponential relationship between RSSI and distance. Practically, the distance estimation model
applies a log-normal distribution. Mathematically it is given in equation (3),
(3)
Where dk
refers the distance to static node and the standard deviation of the distance
estimated .Thus, the probability density function (PDF) is estimated using
equation (4).
(4)
Where d refers the real estimated distance. Thus, retrieving PDF of the distance measure, the CR
region of the a-th static node is estimated. Here, we represent CR as Ca that signifies the area in
which the mobile node is present with confidence likelihood qLN. Now, considering omni-
directional antennas, CR presents a circle with radius centered over a-th static node position,
while fulfilling the following condition
We derive qLN
as equation (5)
(5)
Thus, the m-th mobile node characterizes its CR by overlapping CRs of the L nearest static nodes
as shown in equation (6). Mathematically,
10. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
50
(6)
In our node positioning model, mobile node estimates its location, within its CR by
estimating the discrete points distributed uniformity within . The mobile node calculates the
probability to be present in each point of Cm using PDF, as estimated by (4). Assuming that the
PDFs of different static nodes are autonomous, the mobile node estimates its location using
equation (7).
(7)
Where Av
represents the set of static nodes used for mobile-node positioning. The other variable
dc,a presents the Euclidean distance between c-th point to a-th static or the anchor node.
5.2 MALQI mobile-RPL
Our proposed MALQI based mobile-RPL protocol performs routing in following two phases:
a) Inter-Static Node Routing (ISNR)
b) Mobile-to-Static Node Routing (MSNR)
A brief discussion of the applied routing mechanisms is given as follows:
5.2.1 Inter Static Node Routing
In this paper we have applied MALQI based RPL routing model to perform data transmission
between anchor nodes or the static nodes. However, since inter-anchor communication doesn’t
involve node mobility and hence link outage probability is very confined. It states that even
native RPL can be efficient to perform communication between static or anchor nodes. In our
research work, the DODAG is formed using DIOs control messages. Being MALQI based
routing; we estimate the node rank by measuring both ETX as well as current RSSI. Thus, these
multiple constraints are used as the objective function to identify or select best parent node, which
is then followed by the selection of best forwarding path for data forwarding or transmission.
Here, a node i at first measures RSSI of the node in parent set based on which the PDR is
estimated. Finally, using estimated PDR the ETX objective function is calculated using (8). The
total end-to-end ETX counts from i source or transmitter or the jth forwarding node is obtained as
ETXij in equation (8).
Mathematically,
(8)
Where, represents the total required to reach th static node. The other variable
refers the total ETX of the jth node. Here, the ETX between the two nodes, i and j is estimated as
the reciprocal of PDR. i.e. .In addition, when making best forwarding path
selection decision, the anchor or static node estimates current RSSI of the neighboring node. The
11. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
51
consideration of ETX as well as current RSSI for best parent node selection and forwarding path
selection strengthen routing protocol to assure reliable and QoS communication over LLNs.
5.2.2 Mobile to Static Node Routing (MSNR)
In fact, the native RPL is designed with static node only and therefore it does not possess strategic
measures to deal with mobility in network topology. In addition to the energy exhaustion,
computational overheads and delay, control signaling required for maintaining or assuring QoS
communication becomes too complex with mobility based RPL [27]. To alleviate this issue, in
this work we have developed a multi-constraints adaptive link quality index (MALQI) based
mobile-RPL routing protocol. Additionally, the inclusion of positioning information enables our
proposed routing model robust enough to ensure reliable communication over mobile-RPL. The
mobile nodes select their parent node based on MALQI model that estimates RSSI based ETX
count and current RSSI of the node to decide parent node. In our model, when transmitting packet
from th static node, the total end-to-end ETX for th mobile node (say,ETXm) is estimated as
the sum of ETX from node itself to the th static node (ETXm,a) and the ETX from static to the
destination (ETXa) shown in equation(9):
(9)
Additionally, ETXa can be retrieved from the rank of the -th static node estimated using (8).
Noticeably, in the proposed routing model the key parameters such as the rank information, ETX,
current RSSI are embed in the field of DIO control packet. We have estimated ETXm,a as the
reciprocal of PDRm,a. PDR is measured as the likelihood of getting a packet successfully at th
time slot with RSSI more than the transceiver’s sensitivity (RSSIth) [28]. Mathematically shown
in equation (10):
(10)
Assuming decaying RSSI over distance (log-distance path loss model), PDRm,a is obtained as
equation (11).
(11)
As, refers Gaussian distribution is estimated using equation (12).
(12)
In our model X is used to enable clarity rather using .
In our model, is replaced by Thus, exploiting RSSI information and associated PDR
value, mth mobile node selects its parent node using following mathematical formulation
shown in equation (13):
(13)
12. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
52
The detailed discussion of the MALQI routing approach and associated functionalities is
presented in the following sub-sections.
5.3 MALQI mobile-RPL Based Routing Mechanism
Generally, in case of the static network type, the RPL estimates the ETX value for each node and
measures the link quality to decide best parent node. Applying estimated link quality or link
information about its neighboring node, it identifies the parent node by extracting DIO messages,
where DIO message contains significant ETX, RSSI and rank information. In addition, based on
application-specific scenario, there can be only source node as the mobile over certain statically
established relay network or all nodes as in mobile vehicular communication. In such cases, RPL
node might not have the precise information about the link quality of its parents. This is because
the parent nodes itself might be varying temporally and spatially. It enables the selection of the
parent node as highly difficult. Some of the key reasons are the reduced DIO frequency that
confines node from discovering the availability of the new parent node (i.e., parent set). Even if it
exhibits it, as the node has not sent the packets to any of the parents from the updated parent-list
or parent-set, there is no significance of estimating the link ETX of these parents for the best
parent selection. Considering these intricacies over real-world network scenario, with mobile-
RPL our proposed routing model incorporates ETX and current RSSI as path metrics for best
parent node selection. Here, the rationale of using this multiple constraint is twofold. Since RSSI
characterizes the present link quality, which is significantly related to the PDR to be used for
ETX estimation [29], its consideration is vital to ensure reliable and optimal packet transmission
through best alternate parent (and thus best forwarding path). Since, the estimation of RSSI can
be done directly from the incoming DIO messages transmitted from the neighboring nodes that
additionally comprises rank information can play vital role in estimating path metric. However,
depending on DIO messages for the current link information might result into disabling the trickle
timer [17]. Therefore, in this paper our proposed MALQI based mobile-RPL routing protocol the
trickle timer is disabled and the DIO messages are transmitted periodically. This section briefs
about the algorithmic and implementation aspects of the proposed routing approach named
MALQI.
To execute MALQI over mobile-RPL, our proposed routing model ensures that each node in a
DODAG maintains the list of its parent node based on respective path metrics. Additionally, we
consider that the protocol stack facilitates required connectivity at the network layer to retrieve
information about the link layer transmission. Once detecting any link outage due to mobility, the
link layer of the RPL node executes MALQI in parallel (that functions in parallel to the link
layer). Our proposed MALQI model at first examines the parent nodes in proactively updated
parent set where parent nodes are updated in the decreasing order of respective rank and RSSI
value. Here, finding link outage RPL nodes assess each parent node for its suitability for being
parent node, and thus identifying best parent node it rebuilds best forwarding path to transmit data
packets. Noticeably, the newly formed path functions as alternative to the path underwent link
outage (due to mobility or resulting adversaries). In case a RPL node does not find optimal best
parent node, it behaves as a new node and thus MALQI executes node discovery phase. In node
discovery sending multicast beacon message it retrieves path metrics and thus applying multiple
contestants as RPL objective functions (i.e., MALQI) it performs best parent node. Once
obtaining the best parent node, a parallel best forwarding path is constructed through which the
data communication is made. Thus, the overall mechanism ensures link-outage resilient or fault
resilient routing model for mobile-RPL to be used in mobility based LLN applications. The
following figure (Fig. 2) presents the proposed MALQI model based best forwarding path
selection and data transmission over mobile-RPL.
13. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
53
AlGORITHM:
Packetcurrent: Data Packet to be transmitted
Parentcurrent: Receiving node of the Current data packet.
AssignMACretry count: It assigns MAC level retransmission count for the current
packet Packetcurrentfor Parentcurrent
Select alternate parent Parentalternate() for BFN based transmission
Retrieve best Parentsmax()
for each packet do
Parentcurrent = Set as default preferred parent
Parentsmax = Retrieve Parentsmax (Step-5)
Parentattempted= 0
Obtain data backup for Packetcurrent
Initiate Transmission Tx;
Assign MACretry count (Packetcurrent, Packetcurrent)
Transmits (Packetcurrent)
Par attempted++
Wait for ACK (MAC Txstatus())
if MAC Txstatus=1 then
Release backup data or free bufferbackup()
else
Update Parentcurrent Parentalternate
if ((!Parentcurrent) || (Parentattempted>Parentsmax))
then
Release backup data or free bufferbackup()
end if
Initiate transmission Tx
end if
end for
Fig. 2. MALQI based data best forwarding path selection and data transmission
In summary, the overall proposed system can be summarized as: once network layer receives a
packet to transmit, the native RPL executes first, and once finding link-outage at certain time step
or instant MALQI-RPL comes into existence and estimates the parent and best forwarding path
for forwarding the packet. Being a mobile node based RPL, the sensibility of the proposed routing
model is affected significantly, and its efficacy is characterized by how swiftly it can react to the
channel conditions in case of any link-outage condition. In our proposed model, since for each
new data packet is being transmitted to the selected RPL parent, we follow the RPL generated
path under normal channel conditions. Once detecting any link-outage or parent failure MALQI
executes node discovery and identifies the alternate parent. In our proposed routing model,
MALQI is executed when a node fails to forward its data to the current parent within the
predefined maximum MAC-level retransmission limit.
6. RESULTS AND DISCUSSIONS
Considering the significance of mobility based RPL routing protocol for Low Power Lossy
Networks (LLNs) applications, in this paper we developed an efficient and robust routing model
that considers almost every inevitable functional behavior of the routing approach. In this
research model, the predominant emphasis was made towards developing multiple constraints
based best parent selection and associated best forwarding path formation, link quality adaptive
node positioning etc. These all novelties enabled our proposed Multi-constraints Adaptive Link
14. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
54
Quality Index (MALQI) routing model to exhibit reliable data transmission over mobile-RPL,
even under link-outage conditions. Realizing the direct impact of RSSI on PDR and associated
ETX count, in our model RSSI adaptive ETX was considered as decision variable for best parent
node. In addition, to enable reliable link connectivity (so as to avoid any link outage due to
mobility caused dynamic topology) dynamic RSSI of each neighbouring node is selected as the
second constraint for parent node selection. Based on adaptive RSSI value, a parent set table is
formed that stores parent nodes in decreasing order of RSSI level. Once the node (link layer)
detects the link-outage it executes network discovery and retrieves the best parent node from the
parent set node table. In this way, identifying best parent node and forming best forwarding path
the node transfers its data to the destination. Here, it should be noted that the prime objective is
made on enabling reliable data communication over mobile-RPL, and therefore node maintains a
backup of data to be transmitted, and hence applying alternate best forwarding path it transfers
the data to the destination. One more calibrated approach applied in our model was the avoidance
of varying Trickle timer that avoids significant control message overheads and resource
consumption. Here, we have considered trickle timer at a fixed rate (i.e., 2 ms).
The overall proposed MALQI enriched mobile-RPL protocol is developed using Contiki-Cooja
Simulator, where it (MALQI) functions as a network plug-in. In fact, our proposed MLAQI
model functions as a plug-in over the RPL network protocol stack of Contiki. The overall
simulation model was developed and examined over Contiki-2.7 platform. One noticeable feature
of the proposed model is its lightweight nature of the implementation, in which it takes only 2 KB
of flash memory to implement MALQI over entire resource constrained RPL motes (i.e., Sky
mote). To assess the efficiency of the proposed mobile-RPL routing approach, the overall
performance has been examined in terms of packet delivery ratio (PDR), delay, node density
versus PDR, and payload versus PDR, etc. To perform graphical presentation of the results, we
have used MATLAB 2015 a platform, where the consolidated outputs for different parameters are
given as input, and accordingly performance evaluation is done. To examine the performance of
the proposed mobile RPL routing protocol and best forwarding path selection model, two test
cases have been considered. In the first case the performance of the proposed MALQI-RPL has
been compared with the native RPL. On the other hand, in the second RPL protocol MALQ-RPL
performance is compared with other state-of-art mobile-RPL routing protocol.
6.1 MALQI-RPL Vs Native RPL
In this test case, our proposed Multiple Constraints Adaptive Link Quality Index (MALQI) based
mobile-RPL routing protocol, as well as the native RPL routing protocol, were examined for
respective efficiency for mobile routing purpose over LLNs. MALQI considers ETX as well as
adaptive (i.e., current) RSSI of a node to decide best parent node for forwarding path selection.
On the contrary, native RPL considers ETX as the sole objective function for parent selection.
Fig. 3 presents the performance of the proposed routing protocol in terms of packet delivery ratio
(PDR) when the varying number of packet transmission or payload. Looking into the results (Fig.
3), it can be found that the proposed MALQI-RPL routing model exhibits almost or near 100%
throughput, on the contrary, native RPL under mobility exhibits relatively lower PDR. Here the
prime reason of reduced PDR can be the parent node selection issue. No doubt, with generic or
native RPL there could be delay in identifying best parent node and forwarding path, this as a
result could lead data drop. Proposed MALQI routing model initiates node discovery once
identifying the fault or link outage, in that case since the proposed routing model encompasses
parent set table and initially identifies best RPL node for alternate path formation. Due to this
robustness, MALQI avoids transient node discovery and hence achieves low latency or delay
(Fig. 8). Consequently, it helps in forming an alternate forwarding path swiftly and hence
provides higher throughput. In major communication scenario, especially for real-time
applications there used to be varying payload, and hence adaptive a best forwarding path to carry
15. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
55
the at-hand packets or load is the must. We have examined the performance of MALQI-RPL
routing protocol by varying packets per second. Here, we have examined relative PDR by varying
packet rate (i.e., 1 packet/sec, 2 packets/sec, 4 packets/sec, 8 packets/sec and 10 packets/sec).
Observing Fig. 4, it can be visualized that the proposed MALQI-RPL based routing model
exhibits higher PRR than the native RPL. The result depicts that the proposed mobile-RPL
routing model is capable of sustaining higher PRR even under increasing packet rate. Here, not
only the efficacy of multiple constraints and adaptive RSSI (say, current link quality) based best
parent selection and path formation technique strengthen the proposed routing model, but also the
link quality adaptive mobile node positioning enables optimal node movement. This consequently
enables efficient data gathering and the consideration of adaptive link enables reliable
communication to assure low packet loss and hence higher PRR.
Fig. 3. Packet Delivery ratio Vs number of packet retransmission
Fig. 4. Packet Received Ratio (PRR) Vs packets per second
Fig. 5 presents PDR performance while varying packet injection rate or number of packets
variation. Due to mobility in LLNs there can be dynamic network parameter variations,
topological changes and link variation causing link outage and data loss. Since, in our research we
emphasized on assuring minimum data loss even under mobility or link-outage probability, our
proposed MALQI-RPL routing protocol has accomplished anticipated performance. Fig. 6
confirms that the proposed routing model is capable of delivering optimal packets to the
destination while ensuring minimal packet loss, even under varying payload or packet injection
rate. This is because of the link adaptive parent node selection and swift best forwarding path
selection.
16. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
56
Fig. 5. Packet delivery ratio Vs packet injection rate (p/sec)
Fig. 6. Packet loss rate Vs packets per second
No doubt, maintaining minimum number of hops often gives confidence to have higher
performance and reliability. Low hop counts not only reduces the probability of link-outage due
to mobility but also alleviates the likelihood of data loss. To achieve higher PDR or reliable data
transmission our proposed MALQI-RPL routing model has exhibited lower loss than the native
RPL based routing (Fig. 7). The native RPL routing protocol with higher hops or ETX undergoes
link outage due to mobility, and hence suffers higher packet loss (Fig. 7). On contrary, the
proactive parent node table management and MALQI-RPL based best parent node selection
strengthen proposed routing model to assure low packet loss. Additionally, the implementation of
link quality (i.e., current RSSI) adaptive mobile positioning also ensures alleviation of the link
outage. This as a cumulative outcome assures minimum packet loss, as depicted in Fig. 7.
Fig. 7. Packet loss Vs Number of Hops
For any QoS or QoE centric communication requirement, maintaining minimum latency or end-
to-end delay is must. The simulation result as presented in Fig. 8 confirms that the proposed
MALQI-RPL based routing protocol performs better time efficient best route formation and data
transmission. Here, the delay efficiency is because of enhanced swift best parent node selection
17. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
57
and forwarding path selection, even under mobile scenario. Thus, observing overall results for the
proposed MALQI-RPL routing protocol and the state of art native-RPL routing protocol; it is
evident that the proposed MALQI-RPL approach is robust, reliable and time efficient for LLNs
under mobile conditions.
Fig. 8. End-to-end delay Vs number of retransmission
In the above discussion our proposed MALQI-RPL routing protocol was evaluated and assessed
for relative performance. In above results, the proposed routing model has exhibited better than
the state-of-art native RPL based routing. However, to further explore the effectiveness of the
proposed routing approach (i.e., MALQI-RPL), we have compared the results with an existing
mobile RPL routing protocol called Co-RPL. The comparative performance is discussed as
follows:
6.2 MALQI-RPL Vs Co-RPL
We have compared the performance of our proposed MALQI-RPL routing protocol and the
existing mobile-RPL protocol called Co-RPL (Co-RPL: RPL Routing for Mobile Low Power
Wireless Sensor Networks using Corona Mechanism [21]). To enable mobility over LLNs using
RPL, Co-RPL protocol [21] performs mobile node tracking and its position estimation. In fact,
authors [21] applied the corona mechanism to enable RPL router localization under mobility
scenario. However, they could not consider varying link quality, adaptive RSSI based best parent
selection, and more importantly, authors lacked exploiting the significance of RSSI adaptive
mobile node localization or positioning. Unlike Co-RPL, in our proposed multi-constraints
adaptive link quality index (MALQI) RPL protocol, we have applied link quality based mobile
node positioning, multiple constraints (i.e., ETX and current RSSI of the RPL node) based best
parent node selection and DAG formation so as to enable optimal best forwarding path formation.
In this way, hypothetically, our proposed model must exhibit more reliable and efficient
communication than the existing Co-RPL routing approach. To examine this, we have compared
the average performance of the proposed MALQI-RPL and Co-RPL routing protocols. The
results obtained are given as follows:
Fig. 9 presents the PDR performance comparison between the proposed MALQI-RPL routing
protocol and Co-RPL protocol for mobility based LLNs. As depicted in Fig. 9, it can be
visualized that the proposed MALQI-RPL protocol exhibits more PDR than the Co-RPL. This
can be due to the multiple constraints, particularly adaptive link quality-based parent node
selection and forwarding path selection. Additionally, the impact of adaptive RSSI based mobile
node positioning can’t be ignored to have influence of enhanced PDR over the existing system.
18. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
58
Fig. 9. PDR performance comparison between MALQI-RPL and Co-RPL
To examine the effectiveness of the proposed MALQI-RPL routing protocol for varying network
traffic rate, we have assessed the packet loss rate variation with changing load. The average
packet loss ratio obtained reveal that our proposed routing protocol performs better than Co-RPL.
Fig. 10, Fig. 11, and Fig. 12 present the average packet loss observed using our proposed
MALQI-RPL and co-RPL routing protocols for the date rate of 1p/s, 2p/s and 3p/s respectively.
The overall average packet loss is presented in Fig. 13, where it is revealed that the proposed
routing protocol outperforms state-of-art technique Co-RPL.
Fig. 10. Packet Loss ratio comparison between MALQI-RPL and Co-RPL with 1 p/s data rate
Fig. 11. Packet Loss ratio comparison between MALQI-RPL and Co-RPL with 2 p/s data rate
19. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
59
Fig. 12. Packet Loss ratio comparison between MALQI-RPL and Co-RPL with 4 p/s data rate
Fig. 13. Average packet loss ratio comparison between MALQI-RPL and Co-RPL
Fig. 14. Network latency comparison between MALQI-RPL and Co-RPL
Fig. 14 presents the comparison of the network latency performed by both our proposed MALQI-
RPL and Co-RPL routing protocol. Here, it can be found that our proposed routing protocol
performs better than the existing Co-RPL routing protocol. Thus, observing overall results and
their respective significances, it can be found that the proposed routing protocol (i.e., MALQI-
RPL) can be efficient to enable delay resilient, reliable and QoS oriented communication over
LLNs under mobile node conditions or mobile network topology. The overall conclusion of the
presented research is given in the next section.
7. CONCLUSION AND FUTURE SCOPE
In recent years the global human society has witnessed the exponential rising demands for quality
of service (QoS) and Quality of Experience (QoE) oriented wireless communication systems.
Being decentralized and infrastructure less in nature Wireless Sensor Networks (WSNs) has
established itself as one of the potential solution for different communication purposes. The
20. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
60
recently developed routing protocol for low power lossy networks (LLNs), commonly known as
RPL has performed better, especially for IoT ecosystems. However, the unavailability of mobility
in native RPL routing protocol limits its applicability. The predominant reason behind it is the
mobility caused dynamism that introduces topological changes, network parameter variations and
thus makes network management highly intricate. Enabling best parent selection and forwarding
path formation in mobile-RPL can be of paramount significance to enable an array of
communication systems. With this motivation, a novel and robust Multi-Constraints Adaptive
Link Quality Index (MALQI) based parent node and forwarding path selection model is
developed for mobile-RPL based LLNs. In this paper, two significant network parameters
dynamic RSSI and ETX have been used to decide best parent node from the proactively managed
parent-set node table. In this approach, the developed MALQI based mobile-RPL operates in
parallel to the link layer and once detecting link-outage it executes node discovery using proposed
MALQI model. In the proposed model, each RPL node maintains data backup, and once detecting
any link-outage and forming alternate best forwarding path, it transmits data through that path,
and thus avoids performance degradation. Additionally, to avoid any control message caused
overheads and resource (time, memory, energy) consumption, the trickle timer has been disabled
and fixed at the interval of 2 ms. It has significantly improved the computational efficiency of the
proposed routing protocol. The use of ETX that is having direct relation between RSSI and
associated packet delivery ratio (PDR) as the criteria for the best parent node and path selection
strengthens proposed routing protocol to assure reliable and fault resilient transmission over
mobile-RPL. Additionally, the consideration of RSSI adaptive mobile node positioning and inter-
anchor-mobile node communication enables the proposed system reliable and further enables
fault-tolerant communication over RPL. The simulation results obtained confirm that the
proposed MALQI-RPL routing protocol exhibits an improvement of 5% better packet delivery
ratio/received ratio, around 1% low latency and around 5% low packet drop compared to standard
RPL even under varying packet rate or payload conditions. It exhibits its robustness for real-
world burst type communication. The proposed routing model has performed better than not only
the standard RPL based routing, but also recently proposed state-of-art technique called Co-RPL
for mobility based RPL. Thus, the overall results confirm that the proposed routing model
exhibits higher PDR, low loss and low latency even with different payload condition and dynamic
network statistics. In the future, other objective functions can also be explored or derived to
achieve performance with real time test-bed applications.
REFERENCES
[1] Heinzelman W., Kulik, J., Balakrishnan, H.: Adaptive Protocols for Information Dissemination in
Wireless Sensor Networks. In proc. of the 5th ACM/IEEE Mobicom Conference (MobiCom ’99),
Seattle, WA, August, pp. 174-85 (1999)
[2] Intanagonwiwat, C., Goninan R., Estrin, D.: Directed diffusion: a scalable and robust
communication paradigm for sensor networks. In proc. of the ACM MobiCom ’00, Boston, MA, pp.
56-67. Y (2000)
[3] Yao, Y., Gehrke, J.: The cougar approach to in-network query processing in sensor networks. In
ACM SIGMOD Record, vol. 31, no. 3. (2002)
[4] Heinzelman, W., Chandrakasan A., Balakrishnan, H.: Energy-Efficient Communication Protocol for
Wireless Microsensor Networks. In proc. of the 33rd Hawaii International Conference on System
Sciences (HICSS ’00) (2000)
[5] Lindsey, S., Raghavendra, C., PEGASIS: Power-Efficient Gathering in Sensor Information Systems.
In proc. of the IEEE Aerospace Conference. vol. 3, pp. 1125-1130. (2002)
21. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
61
[6] Winter, T., Thubert, P., Brandt, A., Clausen, T., Hui, J., Kelsey, R., Levis, P., Pister, K., Struik R.,
and Vasseur, J.: RPL: IPv6 Routing Protocol for Low power and Lossy Networks. RFC 6550, IETF
ROLL WG. (2012)
[7] Vasseur, J.P: Terminology in Low power And Lossy Networks. Draftietf-roll-terminology-
06.txt. (2011)
[8] Lee, K.C., Sudhaakar, R., Ning, J., Dai, L., Addepalli, S., Vasseur, J. P., Gerla, M.: A
Comprehensive Evaluation of RPL under Mobility. Hindawi Publishing Corporation International
Journal of Vehicular Technology, Vol. 2012.
[9] Vasseur, J., Dunkels, A.: Interconnecting Smart Objects with IP: The Next Internet. Morgan
Kaufmann, 1 edition. (2010)
[10] Tsiftes, N., Eriksson, J., Dunkels, A.: Low-power wireless ipv6 routing with contikiRPL. in
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor
Networks, ser. IPSN ’10. New York, NY, USA: ACM, pp. 406– 407. (2010)
[11] Pavkovi´c, B., Theoleyre, F., Duda, A.: Multipath opportunistic RPL routing over IEEE 802.15.4. in
Proceedings of the 14th ACM International Conference on Modeling, Analysis and Simulation of
Wireless and Mobile Systems, ser. MSWiM ’11. New York, NY, USA: ACM, pp. 179–186. (2011)
[12] Duquennoy, S., Landsiedel, O., Voigt, T.: Let the tree bloom: Scalable opportunistic routing with
ORPL. in Proceedings of the 11th ACM Conference on Embedded Networked Sensor Systems, ser.
SenSys ’13. New York, NY, USA: ACM, pp. 2:1–2:14. (2013)
[13] Hong, K.S., Choi, L.: Dag-based multipath routing for mobile sensor networks. in ICT Convergence
(ICTC), 2011 International Conference on, pp. 261–266. (2011)
[14] Safdar, V., Bashir, F., Hamid, Z., Afzal, H., Pyun, J.Y.: A hybrid routing protocol for wireless sensor
networks with mobile sinks. In Wireless and Pervasive Computing (ISWPC), 2012 7th International
Symposium on, pp. 1–5. (2012)
[15] Ben Saad, L., Chauvenet, C., Tourancheau, B.: Simulation of the RPL Routing Protocol for IPv6
Sensor Networks: two cases studies. in International Conference on Sensor Technologies and
Applications SENSORCOMM 2011. Nice, France: IARIA (2011)
[16] Ben Saad, L., Tourancheau, B.: Sinks Mobility Strategy in IPv6- based WSNs for Network Lifetime
Improvement. in International Conference on New Technologies, Mobility and Security (NTMS).
Paris, France: IFIP, pp. 1-5. (2011)
[17] Korbi, I.E., Ben Brahim, M., Adjih C., Saidane, L.A.: Mobility Enhanced RPL for Wireless Sensor
Networks. 2012 Third International Conference on the Network of the Future (NOF), Gammarth, pp.
1-8. (2012)
[18] Tripathi, J., de Oliveira, J., Vasseur, J.: A Perfor- mance Evaluation Study of RPL: Routing Protocol
for Low Power and Lossy Networks. Information Sciences and Systems (CISS), 2010 44th Annual
Conference on, pp. 1–6. (2010)
[19] Tsiftes, N., Eriksson, J., Dunkels, A.: Poster Abstract: Low-Power Wireless IPv6 Routing with
ContikiRPL. IPSN10, Stockholm, Sweden. p. 1216. (2010)
[20] Kharrufa, H., Al-Kashoash, H., Al-Nidawi, Y., Mosquera, M.Q., Kemp, A.H.: Dynamic RPL for
multi-hop routing in IoT applications. 2017 13th Annual Conference on Wireless On-demand
Network Systems and Services (WONS), Jackson, WY, USA, pp. 100-103. (2017)
[21] Gaddour, O., Koubäa, A., Rangarajan, R., Cheikhrouhou, O., Tovar, E., Abid, M.: Co-RPL: RPL
routing for mobile low power wireless sensor networks using Corona mechanism. Proceedings of the
22. International Journal of Computer Networks & Communications (IJCNC) Vol.10, No.5, September 2018
62
9th IEEE International Symposium on Industrial Embedded Systems (SIES 2014). Pisa. pp. 200-209.
(2014)
[22] Somaa, F., Korbi, I. E. l., Adjih, C., Saidane, L.A.: A modified RPL for Wireless Sensor Networks
with Bayesian inference mobility prediction. 2016 International Wireless Communications and
Mobile Computing Conference (IWCMC). Paphos, pp. 690-695. (2016)
[23] Barcelo, M., Correa, A., Vicario, J. L., Morell, A., Vilajosana, X.: Addressing Mobility in RPL With
Position Assisted Metrics. In IEEE Sensors Journal, vol. 16, no. 7, pp. 2151-2161. (2016)
[24] Lohith, Y.S., Narasimman, T.S., Anand, S.V.R., Hedge, M.: Link Peek: A Link Outage Resilient IP
Packet Forwarding Mechanism for 6LoWPAN/RPL Based Low-Power and Lossy Networks (LLNs).
IEEE International Conference on Mobile Services. New York. NY. pp. 65-72. (2015)
[25] Lee et al., K.C.: RPL under Mobility. In proc. of the IEEE Consumer Communications and
Networking Conference (CCNC) (2012)
[26] Levis, P., Clausen, T., Hui, J., Gnawali, O., Ko, J.: The Trickle Algorithm. RFC 6206 (Proposed
Standard). (2011)
[27] Gungor, V.C., Hancke, G.P.: Industrial Wireless Sensor Networks: Applications, Protocols, and
Standards. CRC Press, Inc., Boca Raton, FL, USA, 1st edition. (2013)
[28] Raman, B., Chebrolu, K., Madabhushi, N., Gokhale, D.Y., Valiveti, P. K., Jain, D.: Implications of
link range and (in) stability on sensor network architecture. WiNTECH '06, ACM. New York, NY.
USA. pp. 65-72. (2006)
[29] Srinivasan, K., Levis, P.: RSSI is under appreciated. In Proceedings of the Third Workshop on
Embedded Networked Sensors. EmNets. (2006)
[30] Sneha K, Dr. B.G.Prasad.: An Efficient Hand-off Optimization Based RPL Routing Protocol for
Optimal Route Selection in Mobility Enabled LLNs in IEEE International Conference on Global
Trends in Signal Processing, Information Computing and Communication (ICSPICC-2016), Jalgaon,
India: IEEE. (2016).