scholarly journals An improved asynchronous energy-saving mechanism for IEEE 802.15.5-based networks

2018 ◽  
Vol 14 (9) ◽  
pp. 155014771880218
Author(s):  
Li-yong Yuan ◽  
Fei-long Lin ◽  
Jun-ke Lv
Keyword(s):  
Energy Saving ◽  
Destination Node ◽  
Simulation Evaluation ◽  
Multiple Routes ◽  
Routing Mechanism ◽  
Sleep Schedule ◽  
Idle Listening ◽  
Ieee 802.15.5 ◽  
Reliability And Robustness ◽  
Performance Analysis And Simulation

IEEE 802.15.5 standard introduces the mesh routing which improves reliability and robustness of routing in wireless sensor network since there are multiple routes from source node to destination node. To achieve energy efficiency for a long network lifetime, the asynchronous energy saving is proposed in IEEE 802.15.5, which includes the receiver-initiated unicast mechanism and the sender-initiated broadcast mechanism. In this article, an improved asynchronous energy saving named semi-synchronous energy saving is proposed to deal with the energy inefficiency from idle listening existing in asynchronous energy saving. In semi-synchronous energy saving, every node maintains the wake/sleep schedule information of nodes in its two-hop neighborhood and uses this information to calculate the wake-up time of an interested neighbor that the data will be sent to, which reduces idle listening time in both unicast and broadcast mechanisms. A low delay routing mechanism is also proposed based on the wake/sleep schedule information of neighbors. Furthermore, the optimal guard time to guarantee receiving the wake-up notification from neighbor in the presence of clock drift is investigated for saving energy. The performance analysis and simulation evaluation show that semi-synchronous energy saving saves more than 80% of energy with less than 30% memory cost compared to asynchronous energy saving, and it also improves the time of completing broadcast and the end-to-end delay.

scholarly journals Energy-Efficient and Disjoint Multipath Using Face routing in Wireless Sensor Networks

Energies ◽  
2021 ◽  
Vol 14 (22) ◽  
pp. 7823
Author(s):  
Hyunchong Cho ◽  
Seungmin Oh ◽  
Yongje Shin ◽  
Euisin Lee
Keyword(s):  
Energy Consumption ◽  
Average Energy ◽  
Packet Transmission ◽  
Destination Node ◽  
Path Generation ◽  
Data Packets ◽  
Hole Area ◽  
Face Routing ◽  
Multiple Routes ◽  
Average Energy Consumption

In WSNs, multipath is well-known as a method to improve the reliability of packet delivery by making multiple routes from a source node to a destination node. To improve reliability and load-balancing, it is important to ensure that disjoint characteristics of multipath do not use same nodes during path generation. However, when multipath studies encounter a hole area from which is hard to transmit data packets, they have a problem with breaking the disjoint features of multipath. Although existing studies propose various strategies to bypass hole areas, they have side effects that significantly accelerate energy consumption and packet transmission delay. Therefore, to retain the disjoint feature of multipath, we propose a new scheme that can reduce delay and energy consumption for a node near a hole area using two approaches—global joint avoidance and local avoidance. This scheme uses global joint avoidance to generate a new path centered on a hole area and effectively bypasses the hole area. This scheme also uses local joint avoidance that does not select the same nodes during new path generation using a marking process. In simulations, the proposed scheme has an average 30% improvement in terms of average energy consumption and delay time compared to other studies.

scholarly journals Research on Dynamic Routing Mechanisms in Wireless Sensor Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
A. Q. Zhao ◽  
Y. N. Weng ◽  
Y. Lu ◽  
C. Y. Liu
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Transmission Efficiency ◽  
Dynamic Routing ◽  
Link Quality ◽  
Wireless Sensor ◽  
Network Applications ◽  
Routing Mechanism ◽  
Reliability And Robustness ◽  
Simulation And Evaluation

WirelessHART is the most widely applied standard in wireless sensor networks nowadays. However, it does not provide any dynamic routing mechanism, which is important for the reliability and robustness of the wireless network applications. In this paper, a collection tree protocol based, dynamic routing mechanism was proposed for WirelessHART network. The dynamic routing mechanism was evaluated through several simulation experiments in three aspects: time for generating the topology, link quality, and stability of network. Besides, the data transmission efficiency of this routing mechanism was analyzed. The simulation and evaluation results show that this mechanism can act as a dynamic routing mechanism for the TDMA-based wireless sensor network.

scholarly journals Underwater Routing Protocols: Analysis of Intrepid Link Selection Mechanism, Challenges and Strategies

2020 ◽  
Author(s):  
Shahzad Ashraf ◽  
Tauqeer Ahmed
Keyword(s):  
Routing Protocol ◽  
Base Station ◽  
Packet Transmission ◽  
Sensor Nodes ◽  
Destination Node ◽  
Delivery Ratio ◽  
Communication Link ◽  
Routing Mechanism ◽  
Pollution Detection ◽  
Terrestrial Network

Abstract The sensor nodes deployed in underwater environment has different routing mechanism in contrast to the terrestrial network. Getting underwater data on pollution detection, control of the ecosystem, marine mining, catastrophe avoidance and strategic surveillance thereby demands smooth packet transmission from dynamic nodes to base station encounters numerous challenges, out of which selecting best communication link between source and destination node is a key phenomenon of Underwater sensor network. The meticulous research has been conducted to search out the best link selection mythology of bodacious underwater routing protocol EnOR, SURS‐PES and USPF. The performance has been evaluated through NS2 simulation for packet delivery ratio, end-to-end delay, network lifespan and network energy consumption.

The Research of Self-Adaptative Power Adjustment Routing

2014 ◽  
Vol 986-987 ◽  
pp. 2082-2085
Author(s):  
Zhi Ping Ding
Keyword(s):  
Cognitive Radio ◽  
Power Consumption ◽  
Energy Saving ◽  
Real Time ◽  
Ad Hoc Network ◽  
Ad Hoc ◽  
Power Type ◽  
Power Adjustment ◽  
Routing Mechanism ◽  
Internal Capacity

Cognitive Radio Ad Hoc Network (CRAHN), established on the cognitive radio environment, configures the Ad Hoc Network which possesses the internal capacity. How to effectively control the power consumption is an important issue in the CRAHN for CRAHN‘s main power type is battery. At present, the energy-saving routing research in CRAHN is mainly based on the real-time routing mechanism. It means that it should be routed again after transferring an archive. In order to increase the network route’s surviving time and save the power consumption, it introduces a routing mechanism whose purpose is to optimize the communication algorithm’s performance by improving the existing routing mechanism in the Ad Hoc network.

Collaborative Packet Dropping Intrusion Detection in MANETs

2019 ◽  
Vol 12 ◽  
Author(s):  
Gopichand G ◽  
Saravanaguru Ra. A.K.
Keyword(s):  
Routing Protocols ◽  
Packet Delay ◽  
Detection Methods ◽  
Destination Node ◽  
Packet Dropping ◽  
Wireless Broadcast ◽  
Self Organized ◽  
Routing Mechanism ◽  
Wireless Adhoc Networks ◽  
Detection Schemes

: Wireless Networks treat MANET as a network that requires no preexisting infrastructure for setting up the network and is self-organized dynamically, which is made on impermanent basis. In MANET, Nodes are peripatetic hence topology remains not fixed for them. Hence all member nodes are harmonized with each other for establishing the network. MANET includes wireless broadcast from source to destination for forwarding data in the form of packets. Before transmitting the packets from the source to the destination node, route is searched to the destination node starting from the source node. Due to the absence of special routers in MANET, the nodes themselves act as routers and co-operates in performing the routing mechanism. During the packet dispatchment to the destination from the source, there might be a critical attack which leads to the dropping of the packet. This dropping of packets is the most popular risks in MANETS. Such type of attackers applies a primary shortcut which possesses grudging characteristics since the path finding technique is vigorous and inevitable in a MANET. Many researches and investigations were performed using distinct detection methods and recommended various types of detection schemes for such attacks. There are some special routing protocols existing in MANET like AODV, DSR, DSDV, etc. which are defenseless against several types of nasty actions such as packet drops, packet modifications, packet delay etc because of the self-seeking nodes in addition to the attacker nodes present in MANET. The proposed work refers to the diverse properties of collective packet dropping intrusions and scrutinizes the classes of proposed protocols with specific topographies warehoused in wireless adhoc networks. Finally a comparative analysis with these protocols along with their approaches with reverence to throughput, time and other key determinants in MANET is performed.

Design and Implementation of Binary Tree Based Proactive Routing Protocols for Large MANETS

2011 ◽  
Vol 2 (4) ◽  
pp. 82-94
Author(s):  
Pavan Kumar Pandey ◽  
G. P. Biswas
Keyword(s):  
Routing Protocol ◽  
Binary Tree ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Destination Node ◽  
Large Network ◽  
Mobile Nodes ◽  
Proactive Routing ◽  
Routing Mechanism ◽  
Local Routing

The Mobile Ad hoc Network (MANET) is a collection of connected mobile nodes without any centralized administration. Proactive routing approach is one of those categories of proposed routing protocol which is not suitable for larger network due to their high overhead to maintain routing table for each and every node. The novelty of this approach is to form a binary tree structure of several independent sub-networks by decomposing a large network to sub-networks. Each sub-network is monitored by an agent node which is selected by several broadcasted regulations. Agent node maintains two routing information; one for local routing within the sub-network and another for routing through all other agent node. In routing mechanism first source node checks for destination within sub-network then source sends destination address to respective parent agent node if destination is not available in local routing, this process follows up to the destination node using agent mode. This approach allowed any proactive routing protocol with scalability for every routing mechanism. The proposed approach is thoroughly analyzed and its justification for the connectivity through sub-networks, routing between each source to destination pair, scalability, etc., are given, which show expected performance.

Design and Implementation of Binary Tree Based Proactive Routing Protocols for Large MANETS

2013 ◽  
pp. 359-372
Author(s):  
Pavan Kumar Pandey ◽  
G. P. Biswas
Keyword(s):  
Routing Protocol ◽  
Binary Tree ◽  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Destination Node ◽  
Large Network ◽  
Mobile Nodes ◽  
Proactive Routing ◽  
Routing Mechanism ◽  
Local Routing

The Mobile Ad hoc Network (MANET) is a collection of connected mobile nodes without any centralized administration. Proactive routing approach is one of those categories of proposed routing protocol which is not suitable for larger network due to their high overhead to maintain routing table for each and every node. The novelty of this approach is to form a binary tree structure of several independent sub-networks by decomposing a large network to sub-networks. Each sub-network is monitored by an agent node which is selected by several broadcasted regulations. Agent node maintains two routing information; one for local routing within the sub-network and another for routing through all other agent node. In routing mechanism first source node checks for destination within sub-network then source sends destination address to respective parent agent node if destination is not available in local routing, this process follows up to the destination node using agent mode. This approach allowed any proactive routing protocol with scalability for every routing mechanism. The proposed approach is thoroughly analyzed and its justification for the connectivity through sub-networks, routing between each source to destination pair, scalability, etc., are given, which show expected performance.

An Improved AODV Routing Protocol for High Moving VANET

2013 ◽  
Vol 380-384 ◽  
pp. 2286-2291
Author(s):  
Yuan Ming Ding ◽  
Hao Qu ◽  
Xue Wang
Keyword(s):  
Routing Protocol ◽  
Ad Hoc Network ◽  
Loss Rate ◽  
Ad Hoc ◽  
Destination Node ◽  
Repair Mechanism ◽  
Local Repair ◽  
Structure Changes ◽  
Routing Mechanism ◽  
Aodv Routing Protocol

For the problems of the inefficient communication, increscent delay and raised packet loss rate etc. among the nodes caused by the frequent changes of topology in vehicular Ad hoc network (VANET), an improved solution of AODV (Ad hoc On-Demand Vector) routing protocol is proposed using the backup routing mechanism. By modifying the processing of nodes disposing route reply packet (RREP) packets, the source node maintains a routing to the destination node, at the same time it maintains a backup routing and modifies the local repair mechanism. The simulations analyze the performance of AODV routing protocol when the moving speeds of the nodes increase and the network structure changes frequently. The simulation results show that the packet delivery fraction (PDF) increases using the backup routing mechanism which improves the performance of AODV routing protocol.

scholarly journals Dynamic Cloudlet-Assisted Energy-Saving Routing Mechanism for Mobile Ad Hoc Networks

IEEE Access ◽  
2017 ◽  
Vol 5 ◽  
pp. 20908-20920 ◽  
Author(s):  
Jirui Li ◽  
Xiaoyong Li ◽  
Yunquan Gao ◽  
Yali Gao ◽  
Rui Zhang
Keyword(s):  
Ad Hoc Networks ◽  
Mobile Ad Hoc Networks ◽  
Energy Saving ◽  
Ad Hoc ◽  
Routing Mechanism ◽  
Mobile Ad Hoc ◽  
Hoc Networks

scholarly journals Prioritized scheduling scheme for critical and non-critical information packets

2018 ◽  
Vol 7 (3) ◽  
pp. 1705
Author(s):  
K Aanandha Saravanan ◽  
Dr P. Suresh
Keyword(s):  
Energy Saving ◽  
Energy Efficient ◽  
Large Scale ◽  
Mac Protocol ◽  
Destination Node ◽  
Critical Information ◽  
Scheduling Scheme ◽  
End To End Delay ◽  
First In First Out ◽  
Infor Mation

The process of energy saving mechanisms is been utilized by proper planning to transmit both critical clip and non-real infor-mation by reading overheads there by reducing throughput and bandwidth in large scale critical clip networks. The existing bundle sched-uling mythologies used   were based on the First -in First-out (FIFO) manner in such cases the critical information at particular instant cannot be processed quickly but proposed system is designed in such a way it consists of  three tier precedence structure .the critical in-formation  bundles are placed in the higher status prioritizing queue and processed immediately and sent to the destination node where oth-er information bundles are given less precedence on the basis of position for non critical information bundles. The proposed scheme, ener-gy efficient in reducing the number of transmission by using merger technique. The lowest precedence bundles are processed after the higher precedence bundles. The proposed algorithm proves its uniqueness based on end -to-end delay than Energy efficient wake up scheduling MAC (EEWS) and Traffic Adaptive MAC protocol (TAMAC)  

Sign in / Sign up

Export Citation Format

Share Document