Enhancing Network Life-Time of Wireless Sensor Networks through Itinerary Definition and Mobile Agents for Routing among Sensor Nodes

Author(s):  
Ojonukpe Sylvester Egwuche ◽  
Olumide Sunday Adewale ◽  
Samuel Adebayo Oluwadare ◽  
Oladunni Abosede Daramola
2021 ◽  
Vol 10 (6) ◽  
pp. 3353-3360
Author(s):  
Aso Ahmed Majeed ◽  
Baban Ahmed Mahmood ◽  
Ahmed Chalak Shakir

The research domain for wireless sensor networks (WSN) has been extensively conducted due to innovative technologies and research directions that have come up addressing the usability of WSN under various schemes. This domain permits dependable tracking of a diversity of environments for both military and civil applications. The key management mechanism is a primary protocol for keeping the privacy and confidentiality of the data transmitted among different sensor nodes in WSNs. Since node's size is small; they are intrinsically limited by inadequate resources such as battery life-time and memory capacity. The proposed secure and energy saving protocol (SESP) for wireless sensor networks) has a significant impact on the overall network life-time and energy dissipation. To encrypt sent messsages, the SESP uses the public-key cryptography’s concept. It depends on sensor nodes' identities (IDs) to prevent the messages repeated; making security goals- authentication, confidentiality, integrity, availability, and freshness to be achieved. Finally, simulation results show that the proposed approach produced better energy consumption and network life-time compared to LEACH protocol; sensors are dead after 900 rounds in the proposed SESP protocol. While, in the low-energy adaptive clustering hierarchy (LEACH) scheme, the sensors are dead after 750 rounds.


Author(s):  
K Pavan Kumar Reddy Et.al

In wireless sensor networks (WSNs), energy constraint of node is the major issue, as the sensor may be deployed in the area where energy backup or quick replacements may not be available. In such cases, preserving the node energy and prolonging the network life time play crucial role in wireless sensor networks. Similarly, sensor nodes are highly vulnerable to attacks, attackers can easily tamper the sensor node and compromise it. Thus to overcome above stated two problems, the proposed work ensures shortest path routing, which ensures network life time of sensor nodes and the trust based routing, which avoids node compromise attacks. The proposed shortest path routing algorithms takes route through multi-hop nodes to corresponding sink. The shortest path based on the geographical routing strategy chooses the nodes nearest to the routing node and sink node. The novel routing framework proposed in this work considered shortest path with trust based routes. The node's energy is considered to taking reliable node on the routing path, which ensure the packet delivery and avoids any node failure due to less energy. The node's trust value is evaluated with three type, which ensure that the paths created are more reliable


Sensor nodes are exceedingly energy compelled instrument, since it is battery operated instruments. In wsn network, every node is liable to the data transmission through the wireless mode [1]. Wireless sensor networks (WSN) is made of a huge no. of small nodes with confined functionality. The essential theme of the wireless sensor network is energy helpless and the WSN is collection of sensor. Every sensor terminal is liable to sensing, store and information clan and send it forwards into sink. The communication within the node is done via wireless network [3].Energy efficiency is the main concentration of a desining the better routing protocol. LEACH is a protocol. This is appropriate for short range network, since imagine that whole sensor node is capable of communication with inter alia and efficient to access sink node, which is not always correct for a big network. Hence, coverage is a problem which we attempt to resolve [6]. The main focus within wireless sensor networks is to increase the network life-time span as much as possible, so that resources can be utilizes efficiently and optimally. Various approaches which are based on the clustering are very much optimal in functionality. Life-time of the network is always connected with sensor node’s energy implemented at distant regions for stable and defect bearable observation [10].


Author(s):  
Wajeeha Aslam ◽  
Muazzam A. Khan ◽  
M. Usman Akram ◽  
Nazar Abbas Saqib ◽  
Seungmin Rho

Wireless sensor networks are greatly habituated in widespread applications but still yet step behind human intelligence and vision. The main reason is constraints of processing, energy consumptions and communication of image data over the sensor nodes. Wireless sensor network is a cooperative network of nodes called motes. Image compression and transmission over a wide ranged sensor network is an emerging challenge with respect to battery, life time constraints. It reduces communication latency and makes sensor network efficient with respect to energy consumption. In this paper we will have an analysis and comparative look on different image compression techniques in order to reduce computational load, memory requirements and enhance coding speed and image quality. Along with compression, different transmission methods will be discussed and analyzed with respect to energy consumption for better performance in wireless sensor networks.


Author(s):  
Femi A. Aderohunmu ◽  
Jeremiah D. Deng ◽  
Martin Purvis

While wireless sensor networks (WSN) are increasingly equipped to handle more complex functions, in-network processing still requires the battery-powered sensors to judiciously use their constrained energy so as to prolong the elective network life time. There are a few protocols using sensor clusters to coordinate the energy consumption in a WSN, but how to deal with energy heterogeneity remains a research question. The authors propose a modified clustering algorithm with a three-tier energy setting, where energy consumption among sensor nodes is adaptive to their energy levels. A theoretical analysis shows that the proposed modifications result in an extended network stability period. Simulation has been conducted to evaluate the new clustering algorithm against some existing algorithms under different energy heterogeneity settings, and favourable results are obtained especially when the energy levels are significantly imbalanced.


Author(s):  
A. BABU KARUPPIAH ◽  
KEERTHINATH KEERTHINATH ◽  
M. KUNDRU MALAI RAJAN ◽  
K.ASHIF ISMAIL SHERIFF ◽  
S. RAJARAM

A Wireless Sensor Network (WSN) consists of many sensor nodes with low cost and power capability Based on the deployment, in the sensing coverage of a sensor node, typically more nodes are covered. A major challenge in constructing a WSN is to enhance the network life time. Nodes in a WSN are usually highly energy-constrained and expected to operate for long periods from limited on-board energy reserves. To permit this, nodes and the embedded software that they execute – must have energy-aware operation. Because of this, continued developments in energy-efficient operation are paramount, requiring major advances to be made in energy hardware, power management circuitry and energy aware algorithms znd protocols. During Intrusion Detection in sensor networks, some genuine nodes need to communicate with the Cluster Head to inform about the details of malicious nodes. For such applications in sensor networks, a large number of sensor nodes that are deployed densely in specific sensing environment share the same sensing tasks. Due to this, the individual nodes might waste their energy in sensing data that are not destined to it and as a result the drain in the energy of the node is more resulting in much reduced network life time. In this paper, a novel algorithm is developed to avoid redundancy in sensing the data thereby enhancing the life time of the network. The concept of Power Factor bit is proposed while a node communicates with the Cluster Head. The simulation results show that the network life time is greatly enhanced by the proposed method.


Author(s):  
Mohammed Réda El Ouadi ◽  
Abderrahim Hasbi

<p>Wireless Sensor Networks is a group of sensor nodes dispatched in a geographical area for a defined objective. These sensor nodes are characterized by limited capacity of communicating, computing and especially of energy. The performance of these WSN is resting on a good routing protocol, hence the need to choose the routing protocol able to satisfy the wsn's objectives, and to satisfy the common challenge to prolong network life time.</p><p>Several routing concepts have been proposed for the WSN, hierarchical routing is one of the most used concepts. It is divided into 3 types: cluster based routing, grid based routing and chain based protocol. In this paper, we are interested to Study, analyse and compare two popular routing protocols for Wireless sensor networks (WSNs), Low-Energy Adaptive Clustering Hierarchy (LEACH) using clusters based concept and Power-Efficient Gathering in Sensor Information System (PEGASIS) with chain based concept. The both protocols are simulated with Matlab simulator, in order to evaluate its performances against the different users and the WSNs objectives defined.</p>


Sign in / Sign up

Export Citation Format

Share Document