Energy optimized micro genetic algorithm based LEACH protocol for WSN

This article presents the design, analyses and implementation of the novel routing protocol for energy optimization based on LEACH for WSN. Network Lifetime is the major problem in various routing protocols used in WSN. In order to overcome that problem, our proposed routing protocol is developed, which is a combination of Micro Genetic algorithm with LEACH protocol. Our proposed µGA-LEACH protocol, strengthen the cluster head (CH) selection and also reduce the energy consumption of the network when compared to existing protocols. This paper shows the improvement of network lifetime and energy consumption with the optimal CH selection based on a micro genetic algorithm and also compared the results with an existing hierarchical routing protocol like LEACH, LEACH-C, LEACH GA and GADA LEACH routing protocol with various packet sizes, and initial energy.

     

一种无线传感器网络性能评估及优化方法

 文章提出了一种无线传感器网络性能评价及优化方法,以单位能耗所支持的平均数据速率为量度,分析了路由策略、接入机制及物理层传输技术对网络性能的综合影响。在讨论单跳分组成功传输概率、时延的基础上,将问题拓展至多跳网络,对网络端到端分组成功传输概率、耗时、耗能进行了统计分析,导出了单位能耗所支持的平均数据速率的表达式,并依此对网络性能进行了仿真研究。结果表明：网络性能可以通过优化分组发送概率和编码纠错能力的方法得到较大改进。     

Wireless Sensor Network Path Optimization Using Sensor Node Coverage Area Calculation Approach

The proposed work is based on the path optimization approach for wireless sensor network (WSN). Path optimization is achieved by using the NSG 2.1 Tool, TCL Script file and NS2 simulator to improve the quality of service (QoS). Path optimization approach finds best suitable path between sensor nodes of WSN. The routing approach is not only the solution to improve the quality but also improves the WSN performance. The node cardinally is taken under consideration using the ad-hoc on demand distance vector routing protocol mechanism. Ad hoc approach emphasize on sensor nodes coverage area performance along with simulation time. NSG 2.1 Tool calculates the sensor node packet data delivery speed which can facilitate inter-node communication successfully. An experimental result verified that the proposed design is the best possible method which can escape from slow network response while covering maximum sensor nodes. It achieves coverage support in sensor node deployment. The result outcomes show best path for transferring packet from one sensor node to another node. The coverage area of sensor node gives the percentage of average coverage ratio of each node with respect to the simulation time.

     

Energy Efficient Cluster Based Routing Protocol Using Charged System Harmony Search Algorithm in WSN

In general, Wireless Sensor Networks (WSNs) is developed with a group of distributed and locative sensor nodes for sensing different environmental conditions. The primary challenges faced by WSN are: low network time and transmission data delay. In crucial applications like monitoring the ecosystem, military and disaster management, and data routing, the incorporation of WSN is very critical. Henceforth, a Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol was proposed but it was found to be uneconomical for energy management. Also, the optimization of Cluster Head (CH) is considered as NP hard problem. This research work deals the issues in optimal path selection in routing of wireless sensor networks to increase the network lifetime. Various techniques are available in metaheuristics, such as the Charged System Search (CSS), that effectively used to resolve the routing problem. Despite of this, most of the meta-heuristics suffer from local optima issues. A charged system search and harmony search algorithm based routing protocol is presented in this research work. Experimental results present the efficient performance of proposed HS model with increased cluster structures, improved network lifetime and reduced end-to-end delay and average packet loss rate.

     

Design of Two-Step Random Access Procedure for URLLC Applications

The idea of Smart City incorporates a few ideas being technology, economy, governance, people, management, and infrastructure. This implies a Smart City can have distinctive communication needs. Wireless technologies, for example, WiFi, Zig Bee, Bluetooth, WiMax, 4G or LTE have introduced themselves as a solution for the communication in Smart City activities. Nonetheless, as the majority of them utilize unlicensed interference, coexistence and bands issues are increasing. So to solve the problem IoT is used in smart cities. This paper addresses the issues of both resource allocation and routing to propose an energy efficient, congestion aware resource allocation and routing protocol (ECRR) for IoT network based on hybrid optimization techniques. The first contribution of proposed ECRR technique is to employ the data clustering and metaheuristic algorithm for allocate the large-scale devices and gateways of IoT to reduce the total congestion between them. The second contribution is to propose a queue based swarm optimization algorithm for select a better route for future route based on multiple constraints, which improves the route discovering mechanism. The proposed ECRR technique is implemented in Network Simulator (NS-2) tool and the simulation results are compared with the existing state-of-art techniques in terms of energy consumption, node lifetime, throughput, end-to-end delay, packet delivery ratio and packet overheads.

     

GDSR：一种基于车载自组网的分组路由协议

针对DSR路由协议因节点频繁移动,路由发现和路由维护过程频繁发生,导致数据传输的时延增加和丢包率增加的问题.在DSR路由协议基础上,提出一种带有分组的DSR路由协议（GDSR）.该协议通过K-medoids聚类算法合理地选择组头,使得分组路由协议更加适合车载自组网的多变的拓扑结构.仿真结果表明,带有分组的GDSR路由协议能够降低数据传输的端到端的时延和丢包率.     

车载自组织网中基于蚁群算法的延迟感知路由协议

针对城市道路环境下车载自组织网( VANETs)中通信性能下降以及数据传输失败的问题,提出了一种基于蚁群算法的延迟感知路由( ACDR)协议。首先,建立双向车道的数学延迟模型;然后,根据提出的端点十字路口( EI)的概念,ACDR利用蚁群优化( ACO)寻找最佳路线,其中前向蚂蚁根据本地路段延迟以及当前十字路口与目的节点的端点十字路口之间的全局时延来选择路径,后向蚂蚁则负责在返回路径时更新信息素,同时,相邻十字路口之间利用贪婪转发算法进行数据包的传递。最后仿真比较了ACDR协议与连通性感知路由( CAR)协议的性能,结果表明提出的ACDR协议的数据包的传输延迟小,丢包率低,通信性能好。     

Intelligent Agent-Based Assessment of a Resilient Multi-hop Routing Protocol for Dynamic WSN

Wireless sensor networks (WSN) constitute a current field of interest in which the major concerns are related to mobility, spatial distribution, connectivity and dynamic creation of networks between autonomous nodes for cooperative detection and data transfer in diverse areas (e.g., healthcare, environmental or industrial monitoring). To this end, the present work describes the theoretical and practical development of a communication protocol for WSNs based on Bluetooth. The interaction between mobile nodes is performed with a multi-hop scheme in response to traffic needs without requiring a scatternet formation procedure. The interest of this algorithm—based on the concept of routing vector—is that it was designed to withstand changes in the node distribution for high-mobility scenarios, thus allowing the implementation of a robust data routing in low-resource microcontrolled devices with no operability loss. As the main contribution, we present the hardware and software implementation of the communication protocol in real devices along several case studies. With this aim, a long-term experimentation in a dense scenario has been carried out through an intelligent agent-based approach to formally validate the protocol considering three different performance metrics: packet delivery ratio, feedback overhead and round-trip time.

     

NHRPA: a novel hierarchical routing protocol algorithm for wireless sensor networks

Considering severe resources constraints and security threat hierarchical routing protocol algorithm. The proposed routing of wireless sensor networks （WSN）, the article proposed a novel protocol algorithm can adopt suitable routing technology for the nodes according to the distance of nodes to the base station, density of nodes distribution, and residual energy of nodes. Comparing the proposed routing protocol algorithm with simple direction diffusion routing technology, cluster-based routing mechanisms, and simple hierarchical routing protocol algorithm through comprehensive analysis and simulation in terms of the energy usage, packet latency, and security in the presence of node protocol algorithm is more efficient for wireless sensor networks. compromise attacks, the results show that the proposed routing     

A fuzzy multicriteria decision‐making‐based CH selection and hybrid routing protocol for WSN

One of the famous approaches to decision making is named as multicriteria decision making (MCDM). In order to solve the MCDM issues, a better way is provided by the fuzzy logic. Expendability, cost, maintenance, availability of software, and performance characteristics are such problems considered by the decision. The precise estimation of the pertinent data is one of the vital phases in DM systems. This paper presents a fuzzy MCDM‐based cluster head (CH) selection and hybrid routing protocol to solve the most common issues. In this research article, the generalized intuitionistic fuzzy soft set (GIFSS) approach is utilized to select the optimal CH, and hybrid shark smell optimization (SSO), and a genetic algorithm (GA) is introduced for the effective routing. Initially, the wireless sensor network (WSN) system and energy models are designed, and then the nodes are grouped into several clusters. Next, based on the GIFSS, the CH nodes are selected, and finally, an effective routing is placed based on the hybrid optimizations. The implementation is performed on the NS2 platform, and the performances are evaluated by packet delivery ratio (PDR), delay, packet loss ratio (PLR), network lifetime, bit error rate (BER), energy consumption, throughput, and jitter. The existing approaches named energy centers examining using particle swarm optimization (EC‐PSO), variable dimension‐based PSO (VD‐PSO), energy‐efficient PSO‐based CH selection (PSO‐ECHS), low‐energy adaptive clustering hierarchy‐sugeno fuzzy (LEACH‐SF), SSO, and GA are compared with the proposed strategy. According to the implemented outcomes, it displays the proposed strategy and gives improved outcomes than the others.     

一种基于路径信息的WSN路由协议

AODV是一种广泛应用于MANET的按需路由协议,但是它并不完全适用于WSN。本文通过改进AODV协议基于洪泛的路由机制,提出了一种适用于WSN的低开销、低时延的路由协议IAODV。仿真结果表明:与AODV协议相比,IAODV协议可以在保持较高的分组投递率的同时有效降低数据分组的平均端到端时延和路由开销,达到了低开销、低时延的设计目标。     

HSG‐ad hoc network: A novel hierarchical star graph ad hoc network with self‐organization and routing discovery free

In ad hoc wireless networks, most data are delivered by multi‐hop routing (hop by hop). This approach may cause long delay and a high routing overhead regardless of which routing protocol is used. To mitigate this inherent characteristic, this work presents a novel ad hoc network structure that adopts dual‐card‐mode, self‐organization with specific IP naming and channel assignment to form a hierarchical star graph ad hoc network (HSG‐ad hoc). This network not only expedites data transmission but also eliminates the route discovery procedure during data transmission. Therefore, the overall network reliability and stability are significantly improved. Simulation results show that the proposed approach achieves substantial improvements over DSDV, AODV, and DSR in terms of average end‐to‐end delay, throughput, and packet delivery ratio. Copyright © 2009 John Wiley & Sons, Ltd.     

A gradient‐based multiple‐path routing protocol for low duty‐cycled wireless sensor networks

Routing in a low duty‐cycled wireless sensor network (WSN) has attracted much attention recently because of the challenge that low duty‐cycled sleep scheduling brings to the design of efficient distributed routing protocols for such networks. In a low duty‐cycled WSN, a big problem is how to design an efficient distributed routing protocol, which uses only local network state information while achieving low end‐to‐end (E2E) packet delivery delay and also high packet delivery efficiency. In this paper, we study low duty‐cycled WSNs wherein sensor nodes adopt pseudorandom sleep scheduling for energy saving. The objective of this paper is to design an efficient distributed routing protocol with low overhead. For this purpose, we design a simple but efficient hop‐by‐hop routing protocol, which integrates the ideas of multipath routing and gradient‐based routing for improved routing performance. We conduct extensive simulations, and the results demonstrate the high performance of the proposed protocol in terms of E2E packet delivery latency and packet delivery efficiency as compared with existing protocols. Copyright © 2014 John Wiley & Sons, Ltd.     

Developing multi-path routing protocol in MANET using hybrid SM-CSBO based on novel multi-objective function

One of the infrastructure-free networks is mobile ad hoc networks (MANETs) that are built with limited battery life using wireless mobile devices. This restricted battery capability in MANETs creates the necessity of considering the energy-awareness constraint in designing them. As routing protocols, the major aim of MANETs is to create the energy awareness in the network; it improves the network's lifetime through effectively utilizing the available restricted energy. Moreover, it creates some limitations like the mobility constraint, wireless link's sensitivity to environmental impacts, and restricted transmission range and residual energy of nodes that causes rapid modifications in the network topology and frequent link failure. By taking those problems, this paper plans to develop a new multipath routing protocol, where the hybrid optimization algorithm with the integration of cuckoo search optimization (CSO) and butterfly optimization algorithm (BOA) is proposed and named sensory modality-based cuckoo search butterfly optimization (SM-CSBO) for determining the optimal path between the source and destination. The main goal is to select the path with better link quality and more stable links to guarantee reliable data transmission. The multi-objective function is considered with the factors regarding distance, normalized energy, packet delivery ratio, and control overhead to develop an effective routing protocol in MANET. The proposed model of SM-CSBO algorithm has superior than 5.8%, 30.4%, 36.7%, and 39.3%, correspondingly maximized than PSO, SFO, CSO, and SFO algorithms while considering the number of nodes as 150. The simulation outcomes proved that it enhances network performance when compared with the other traditional protocols.     

一种快速收敛的基于距离矢量的自组织网路由协议

本文提出了一种新的快速收敛的基于距离矢量(DV)的路由协议.该协议是在MIL-STD-188-220C路由协议的基础上,结合DSDV的优点,并提出了局部拓扑变化感知、全局拓扑变化感知等思想,加快了拓扑变化的收敛过程,提高了应用层分组传榆率.通过仿真分析对比表明,改进后的整体性能优于DSDV,使之更适合应用于快速移动的无线自组织网络中.     

Sling-shot spider optimization algorithm based packet length control in wireless sensor network and Internet of Things-based networks

Wireless sensor network (WSN) is a well-developed domain suitable in the optimal collection and processing of information needed for the present world. For processing and transmitting the correct data by the network, it is affected by many disrupting factors like interference, battery life, distance between the nodes, and redundant data. There have been many methods proposed in the past. Among all the disrupting factors, routing has been the most studied problem in the WSN literature, whereas packet length sizing has been the most untouched topic compared to routing. Sizing the packet lengths to transmit it through the network is important to get error-free data and run an energy-efficient network. In this paper, we propose a sling-shot spider optimization (S²SO) algorithm for packet length optimization in WSN and Internet of Things (IoT)-based networks. The S²SO algorithm is developed based on the spider's unique behavior of catching prey. The proposed algorithm is implemented in three types of networks: 1-hop, 2-hop, and multi-hop networks. A mathematical model for the communication channel, energy efficiency, and energy consumption is developed for all three types of networks. The proposed packet length optimization model is simulated in MATLAB software and compared with conventional bio-inspired algorithms. The results show that the proposed algorithm is very fast in finding the optimal results and transmits optimal packet size with low error rate of 0.2 p.u. and a high efficiency of 98%.     

Ad Hoc网络中拓扑结构对路由协议性能的影响

介绍了Ad Hoc网络中常见的三种路由协议DSDV、DSR和AODV,针对网络拓扑结构的变化,设计了两种仿真方案,利用NS2仿真工具对三个协议进行了仿真。通过分析报文投递率和平均端到端时延比较了三个协议的性能。仿真结果表明,AODV具有优秀的综合性能,更适合于节点移动速度快且网络拓扑结构变化频繁的网络。     

QoS-aware multi-path video streaming for urban VANETs using ACO algorithm

Drivers can be provided with several beneficial services associated with video streaming in a vehicular ad-hoc network (VANET). Given the dynamic topology and high mobility of VANETs, a single path cannot support the required quality of service (QoS). To maximize global QoS metrics, a two-path model is proposed based on a disjoint algorithm to forward sub-streams over diverse paths from the transmitter to the receiver vehicle. In this solution, the video information spread in separate paths is categorized based on their priority. For this purpose, the protocol for transmitting each kind of video data should be selected cautiously. The present study aims to propose an ant colony optimization-based technique to establish the primary and secondary paths and enhance the QoS of routing paths. To achieve this goal, the QoS routing issue is formulated mathematically as a problem of constrained optimization. Moreover, to achieve high-quality video streaming, inter-frames are transmitted over the user datagram protocol and intra-frames are transmitted over the transmission control protocol (TCP). TCP transmission delays are also minimized using a TCP-ETX algorithm for selecting appropriate paths. According to the simulation results, the proposed two-path solution can be used to improve the quality of video streaming and to enhance the performance in terms of end-to-end delay, packet delivery ratio, and overhead. In this way, the proposed method can outperform several prominent routing algorithms such as adaptive QoS-based routing for VANETs, geographic source routing (GSR), intersection-based geographical routing protocol, and efficient GSR.

     

Sandpiper optimization algorithm with cosine similarity based cross-layer routing protocol for smart agriculture in wireless sensor network assisted internet of things systems

The Internet of Things (IoT) has recently attained a prominent role in enabling smooth and effective communication among various networks. Wireless sensor network (WSN) is utilized in IoT to collect peculiar data without interacting with humans in specific applications. Energy is a major problem in WSN-assisted IoT applications, even though better data communication is achieved through cross-layer models. This paper proposes a new cross-layer-based clustering and routing model to provide a scalable and energy-efficient long data communication in WSN-assisted IoT systems for smart agriculture. Initially, the fuzzy k-medoids clustering approach is used to split the network into various clusters since the formation of clusters plays an important role in energy consumption. Then, a new swarm optimization known as enhanced sparrow search algorithm (ESSA), which is the combination of SSA and chameleon swarm algorithm (CSA), has been introduced for optimal cluster head (CH) selection to solve the energy-hole problems in WSN. A cross-layer strategy has been preferred to provide efficient data transmission. Each sensor node parameter of the physical layer, network layer and medium access control (MAC) is considered for processing routing. Finally, a new bio-inspired algorithm is known as the sandpiper optimization algorithm (SOA), and cosine similarity (CS) has been employed to determine the optimal route for efficient data transmission and retransmission. The simulation of the proposed protocol is implemented by network simulator (NS2), and the simulation results are taken in terms of end-to-end delay, PDR, communication overhead, communication cost, average consumed energy, and network lifetime.     

Congestion Control Performance of R-DSDV Protocol in Multihop Wireless Ad Hoc Networks

Ad hoc wireless networks are composed of mobile nodes communicating through wireless links, without any fixed backbone infrastructure. Frequent topology changes due to node mobility make routing in such dynamic networks a challenging problem. Moreover, successful message routing implies every mobile node is potentially capable of acting as a router, thus supporting store-and-forward mechanisms. However, resource limitations on these nodes also require a control on congestion due to message forwarding. In this paper, we consider our recently proposed randomized version of the well-known Destination-Sequenced Distance Vector (DSDV) routing protocol, referred to as R-DSDV, and validate its performance through extensive simulation experiments. Our results demonstrate that a probabilistic control on message traffic based on local tuning of protocol parameters is feasible, and that R-DSDV outperforms the basic DSDV protocol by significantly reducing the average queue size associated with each mobile node and hence the average packet delay.