scholarly journals EEM-MAC: Enhanced Energy Efficient Mobility aware MAC protocol for Mobile Internet of Things

2021 ◽  
Author(s):  
Diniesh VC ◽  
Murugesan G
Keyword(s):  
Energy Efficient ◽  
Mac Protocol ◽  
Average Power ◽  
Mobile Node ◽  
Mobile Internet ◽  
Delivery Ratio ◽  
Channel Access ◽  
Mobile Nodes ◽  
Control Packet ◽  
Average Power Consumption

Abstract Mobile wireless sensor networks (MWSNs) have become a foremost solution in many emerging applications both in industry and academia. Moreover, considering the mobile node in WSN is a challenging task to designing efficient communication protocols, specifically at a medium access control (MAC) layer. Most of the existing protocols consider only for static and slow mobility. To meet with future MIoT applications, in this paper we propose Enhanced Energy Efficient Mobility aware MAC (EMM-MAC) protocol. Our EMM-MAC protocol consists of 3 contributions i) static synchronization and mobility handling phase to support both environments, ii) By using queue length-based channel access priority for static nodes, and iii) the combined highest signal strength and node status-based channel access priority for mobile nodes without any control packet overhead. The simulation results verify that EMM-MAC yields a notable improvement in the average power consumption, packet latency, and packet delivery ratio performances against the well-known mobility-aware MAC protocols under different mobility models and environments.

scholarly journals The importance of energy efficient in wireless sensor networks

2019 ◽  
Vol 6 (6) ◽  
pp. 207-219
Author(s):  
Ellon Mask ◽  
Surgey Brown ◽  
Wood Lucky ◽  
Lorry Peter
Keyword(s):  
Energy Efficient ◽  
Cluster Head ◽  
High Energy ◽  
Mobile Node ◽  
Sensor Nodes ◽  
Delivery Ratio ◽  
Level Energy ◽  
Mobile Nodes ◽  
Mobile Data ◽  
Mobile Data Collectors

Mobile Node-based routing is an efficient routing technique compared to traditional approaches. Due to this FERP majorly data isolation is provided for sensor nodes, and the network is more energy efficient. The Mobile data collector collects data from only Family heads and forwards to the cluster head. The Node level energy saving scheme is proposed in this work. The performance of this routing protocol is assessed based on Energy consumption, Throughput, Lifetime, Packet Delivery Ratio, Energy efficiency. Most of the Energy is saved due to the introducing of mobile nodes for data collection. Apart from this, we are reducing the load for mobile data collectors also. In general, mobile data collectors have high energy resources. But it is not possible in all terrains. This FERP gives better results in military and plateaus, and irregular terrains where multihop communication is complex. This work is further enhanced by Trust node based routing to improve the lifetime of the network.

scholarly journals Comparative study of energy efficient MAC protocol with channel aware packet Scheduling in MANET

2018 ◽  
Vol 7 (1.9) ◽  
pp. 16
Author(s):  
T Dheepak ◽  
S Neduncheliyan
Keyword(s):  
Ad Hoc ◽  
Mobile Ad Hoc Network ◽  
Packet Scheduling ◽  
Mac Protocol ◽  
Mobile Node ◽  
Delivery Ratio ◽  
Link Failure ◽  
Failure State ◽  
Utility Factor ◽  
Mobile Ad Hoc

Mobile Ad Hoc Network is the centralized communication system which is used for transferring information through a secured mode from one end to another end. However, there is an energy loss that has been noticed in MANET. In this work, an efficient energy based Link Failure State Neighbor Detection Effective Efficient Protocol (LFSNDEEP) is to enhance the energy efficiency of the mobile node, and optimal transmission ratio computes Data, Audio, and Video packets. The proposed research on LFSNDEEP protocol is compared to Effective Efficient Neighbor Detection Protocol (EENDP) and which assigns the channel utilization. In this technique, the hello packet exchanges transmit based height and wavelength of the transmitter with particular distance. The computation of channel utility factor is the best method at link failure without data loss. The vitality utilization mathematical model is illustrated to show the nodes of least consumption by the broad recreation of utilization. The results observed from the proposed scheme shows that the energy level is minimized regarding the packet that loss is improved efficiently. In further, there are two results which can be gained in comparing with EENDP; firstly, packet delivery ratio and throughput get increased. And secondly, the end to end delay is decreased.

scholarly journals Greedy Data Transportation Scheme with Hard Packet Deadlines for Wireless Ad Hoc Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
HyungJune Lee
Keyword(s):  
Wireless Ad Hoc Networks ◽  
Ad Hoc ◽  
Routing Algorithm ◽  
Mobile Node ◽  
Network Services ◽  
Delivery Ratio ◽  
Mobile Nodes ◽  
Packet Delivery ◽  
Hoc Networks ◽  
Ad Hoc Sensor Networks

We present a greedy data transportation scheme with hard packet deadlines in ad hoc sensor networks of stationary nodes and multiple mobile nodes with scheduled trajectory path and arrival time. In the proposed routing strategy, each stationary ad hoc node en route decides whether to relay a shortest-path stationary node toward destination or a passing-by mobile node that will carry closer to destination. We aim to utilize mobile nodes to minimize the total routing cost as far as the selected route can satisfy the end-to-end packet deadline. We evaluate our proposed routing algorithm in terms of routing cost, packet delivery ratio, packet delivery time, and usability of mobile nodes based on network level simulations. Simulation results show that our proposed algorithm fully exploits the remaining time till packet deadline to turn into networking benefits of reducing the overall routing cost and improving packet delivery performance. Also, we demonstrate that the routing scheme guarantees packet delivery with hard deadlines, contributing to QoS improvement in various network services.

scholarly journals FQ-MEC: Fuzzy-Based Q-Learning Approach for Mobility-Aware Energy-Efficient Clustering in MANET

2021 ◽  
Vol 2021 ◽  
pp. 1-12
Author(s):  
Naghma Khatoon ◽  
Prashant Pranav ◽  
Sharmistha Roy ◽  
Amritanjali
Keyword(s):  
Network Lifetime ◽  
Energy Efficient ◽  
Optimization Problems ◽  
Behavioral Pattern ◽  
Delivery Ratio ◽  
Learning Approach ◽  
Network Simulator ◽  
Mobile Nodes ◽  
Q Learning ◽  
Energy Efficient Clustering

Different schemes have been proposed for increasing network lifetime in mobile ad hoc networks (MANETs) where nodes move uncertainly in any direction. Mobility awareness and energy efficiency are two inescapable optimization problems in such networks. Clustering is an important technique to improve scalability and network lifetime, as it relies on grouping mobile nodes into logical subgroups, called clusters, to facilitate network management. One of the challenging issues in this domain is to design a real-time routing protocol that efficiently prolongs the network lifetime in MANET. In this paper, a novel fuzzy-based Q-learning approach for mobility-aware energy-efficient clustering (FQMEC) is proposed that relies on deciding the behavioral pattern of the nodes based on their stability and residual energy. Also, Chebyshev’s inequality principle is applied to get node connectivity for load balancing by taking history from the monitoring phase to increase the learning accuracy. Extensive simulations are performed using the NS-2 network simulator, and the proposed scheme is compared with reinforcement learning (RL). The obtained results show the effectiveness of the proposed protocol regarding network lifetime, packet delivery ratio, average end-to-end delay, and energy consumption.

An Energy-Efficient Routing Algorithm for Disruption Tolerant Networks

2013 ◽  
Vol 756-759 ◽  
pp. 3754-3759 ◽  
Author(s):  
Yu Kun Yao ◽  
Wen Xi Zheng ◽  
Zhi Ren
Keyword(s):  
Energy Efficient ◽  
Routing Algorithm ◽  
Cross Layer ◽  
Delivery Ratio ◽  
Cross Layer Design ◽  
Control Mechanisms ◽  
Mobile Nodes ◽  
Energy Efficient Routing ◽  
Transmit Power ◽  
Disruption Tolerant Networks

In Disruption Tolerant Networks (DTN), information is exchanged between mobile nodes with the same transmit power. It is an energy-consuming process and highlights the need for energy-efficient power control mechanisms. If the transmit power of nodes is too low, they might miss many of the opportunities of transmission. On the other hand, high transmit power is energy inefficient. In this paper, we propose ERBC (Energy-efficient Routing algorithm Based on Cross-layer design), an energy-efficient routing algorithm based on cross-layer design. Instead of using fixed transmit power, ERBC dynamically chooses the transmit power using both the cross-lay design and the RSSI technology. Meanwhile, ERBC broadcast data packets partially in order to enhance the delivery ratio. Through simulation, we demonstrate that ERBC can reduce 37% for per-bit energy consumption than that in basic epidemic routing protocol.

scholarly journals An Improved Opportunistic Routing Protocol Based on Context Information of Mobile Nodes

2018 ◽  
Vol 8 (8) ◽  
pp. 1344 ◽  
Author(s):  
Kyung Min Baek ◽  
Dong Yeong Seo ◽  
Yun Won Chung
Keyword(s):  
Routing Protocol ◽  
Average Distance ◽  
Mobile Node ◽  
Opportunistic Routing ◽  
Delay Tolerant Network ◽  
Buffer Size ◽  
Destination Node ◽  
Context Information ◽  
Delivery Ratio ◽  
Mobile Nodes

Delay tolerant network (DTN) protocol was proposed for a network where connectivity is not available. In DTN, a message is delivered to a destination node via store-carry-forward approach while using opportunistic contacts. Probabilistic routing protocol for intermittently connected networks (PRoPHET) is one of the widely studied DTN protocols. In PRoPHET, a message is forwarded to a contact node, if the contact node has a higher delivery predictability to the destination node of the message. In this paper, we propose an improved opportunistic routing protocol, where context information of average distance travelled and average time elapsed from the reception of a message to the delivery of the message to the destination node is used. In the proposed protocol, the average distance and average time are updated whenever a message is delivered to a destination node. Then, both average distance and average time as well as delivery predictability of PRoPHET protocol are used to decide a message forwarding. The performance of the proposed protocol is analyzed and compared with that of PRoPHET and reachable probability centrality (RPC) protocol, which is one of the latest protocols using the contact history information of a mobile node. Simulation results show that the proposed protocol has better performance than both PRoPHET and RPC, from the aspect of delivery ratio, overhead ratio, and delivery latency for varying buffer size, message generation interval, and the number of nodes.

scholarly journals Energy-Efficient Check-and-Spray Geocast Routing Protocol for Opportunistic Networks

Information ◽  
2020 ◽  
Vol 11 (11) ◽  
pp. 504
Author(s):  
Khuram Khalid ◽  
Isaac Woungang ◽  
Sanjay Kumar Dhurandher ◽  
Jagdeep Singh ◽  
Joel J. P. C. Rodrigues
Keyword(s):  
Routing Protocol ◽  
Energy Efficient ◽  
Network Performance ◽  
Opportunistic Networks ◽  
Packet Transmission ◽  
Superior Performance ◽  
Delivery Ratio ◽  
Node Mobility ◽  
Mobile Nodes ◽  
Hop Count

Opportunistic networks (OppNets) are a type of challenged network where there is no guaranteed of end-to-path between the nodes for data delivery because of intermittent connectivity, node mobility and frequent topology changes. In such an environment, the routing of data is a challenge since the battery power of the mobile nodes drains out quickly because of multi-routing activities such as scanning, transmitting, receiving, and computational processing, effecting the overall network performance. In this paper, a novel routing protocol for OppNets called Energy-Efficient Check-and-Spray Geocast Routing (EECSG) is proposed, which introduces an effective way of message distribution in the geocasting region to all residing nodes while saving the energy consumption by restricting the unnecessary packet transmission in that region. A Check-and-Spray technique is also introduced to eliminate the overhead of packets in the geocast region. The proposed EECSG is evaluated by simulations and compared against the Efficient and Flexible Geocasting for Opportunistic Networks (GSAF) and the Centrality- Based Geocasting for Opportunistic networks (CGOPP) routing protocols in terms of average latency, delivery ratio, number of messages forwarded, number of dead nodes, overhead ratio, and hop count, showing superior performance.

Dynamic Modeling of Energy Efficient Crab Walking of Hexapod Robot

2011 ◽  
Vol 110-116 ◽  
pp. 2730-2739 ◽  
Author(s):  
Shibendu Shekhar Roy ◽  
Dilip Kumar Pratihar
Keyword(s):  
Energy Efficiency ◽  
Energy Consumption ◽  
Energy Efficient ◽  
Average Power ◽  
Force Distribution ◽  
Hexapod Robot ◽  
Gait Patterns ◽  
Joint Torques ◽  
Foot Force ◽  
Average Power Consumption

Crab walking is the most general and very important one for omni-directional walking of a hexapod robot. This paper presents a dynamic model for determining energy consumption and energy efficiency of a hexapod robot during its locomotion over flat terrain with a constant crab angle. The model has been derived for statically stable crab-wave gaits by considering a minimization of dissipating energy for optimal foot force distribution. Two approaches, such as minimization of norm of feet forces and minimization of norm of joint torques have been developed. The variations of average power consumption and energy consumption per weight per traveled length with velocity or stroke have been compared for crab walking with tripod and tetrapod gait patterns. Tetrapod gaits are found to be more energy-efficient compared to the tripod gaits.

scholarly journals A novel method of mobility-based clustering protocol in software defined sensor network

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Buwen Cao ◽  
Shuguang Deng ◽  
Hua Qin ◽  
Yue Tan
Keyword(s):  
Sensor Network ◽  
High Speed ◽  
Network Performance ◽  
Transmission Rate ◽  
Cluster Head ◽  
Average Power ◽  
Management Control ◽  
Mobile Nodes ◽  
Control Overhead ◽  
Average Power Consumption

AbstractThe distributed clustering method is widely used to extend network lifetime in traditional wireless sensor networks. However, it is difficult to achieve the idea performance of the whole network, such as transmission rate, energy consumption, and control overhead, neglecting the global stability of the network. To tackle this problem, a centralized mobility-based clustering (CMBC) protocol is proposed in the software defined sensor network. The method of CMBC mainly consists of two aspects: first, CMBC clusters the nodes with the connection time between the mobile nodes (i.e., noncluster head nodes, non-CH) and the cluster head (CH) and establishes stable topological structures between the non-CHs and the CH; second, when emergencies occur, the centralization management control center sends the configuration files to replace the CH. Compared to the distributed network of MBC, WCRA and IMP-MECA protocol, the proposed method can be applied in scenarios with high-speed mobile nodes to improve the network performance in terms of transmission successful rate, average power consumption, and average control overhead.

scholarly journals An Efficient Three-Phase Fuzzy Logic Clone Node Detection Model

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Sachin Lalar ◽  
Shashi Bhushan ◽  
Surender Jangra ◽  
Mehedi Masud ◽  
Jehad F. Al-Amri
Keyword(s):  
Fuzzy Logic ◽  
Detection Method ◽  
Average Power ◽  
Phase Iii ◽  
Delivery Ratio ◽  
Network Attacks ◽  
Detection Model ◽  
End To End Delay ◽  
Three Phase ◽  
Average Power Consumption

Wireless sensor networks have been deployed in the open and unattended environment where the attacker can capture the sensors and create the replica of captured nodes. As the clone nodes have been considered legitimate nodes, clone nodes can initiate different network attacks. We have designed a three-phase clone node detection method named fuzzy logic clone node detection (FLCND). The first phase of FLCND checks whether any node is missing from the network or not. In the next phase, FLCND finds out whether any missing node has arisen in the network in a stipulated time. If any missing node is alive, there is a possibility the node may be cloned. The information of suspected nodes is entered into the Hot-List, which has been maintained in the network. Phase III uses the suspected list and finds out the possibility of clone node using fuzzy logic. Two different scenarios have been simulated in NS2 to evaluate FLCND. The simulation result shows that the proposed method increases the packet delivery ratio (PDR) and reduces packet loss, end-to-end delay, and energy consumption. The simulation results illustrate that the FLCND method reduces the average power consumption by 27% and increases the detection rate by 46% compared to the existing techniques.

Sign in / Sign up

Export Citation Format

Share Document