A load-balanced minimum energy routing algorithm for Wireless Ad Hoc Sensor Networks

Wireless Ad Hoc Sensor Networks (WSNs) have received considerable academia research attention at present. The energy-constraint sensor nodes in WSNs operate on limited batteries, so it is a very important issue to use energy efficiently and reduce power consumption. To maximize the network lifetime, it is essential to prolong each individual node’s lifetime through minimizing the transmission energy consumption, so that many minimum energy routing schemes for traditional mobile ad hoc network have been developed for this reason. This paper presents a novel minimum energy routing algorithm named Load-Balanced Minimum Energy Routing (LBMER) for WSNs considering both sensor nodes’ energy consumption status and the sensor nodes’ hierarchical congestion levels, which uses mixture of energy balance and traffic balance to solve the problem of “hot spots” of WSNs and avoid the situation of “hot spots” sensor nodes using their energy at much higher rate and die much faster than the other nodes. The path router established by LBMER will not be very congested and the traffic will be distributed evenly in the WSNs. Simulation results verified that the LBMER performance is better than that of Min-Hop routing and the existing minimum energy routing scheme MTPR (Total Transmission Power Routing).

A Preamble-Based Broadcasting Technique for Wireless Ad Hoc Sensor Networks

Broadcasting is a fundamental operation in any wireless networks, more so in wireless ad hoc sensor networks, where each sensor node has limited transmission range as well as battery power. Although broadcasting in wireless ad hoc sensor networks has many advantages but it can cause serious problems like-broadcast storm, which could cause a lot of contention, redundant retransmission, collision and most importantly, drain immense amount of energy from limited battery powered sensor nodes. In this work, our objective is to reduce the number of retransmission and energy consumption of sensor nodes by using the duty cycle property of wireless ad hoc sensor networks. We propose a preamble-based broadcasting technique for wireless ad hoc sensor networks. We show that in dense wireless ad hoc sensor networks a small size preamble can give maximum network-wide data dissemination rather than using the large preamble, which will only consume immense amount of energy during packet reception.

A Secured Message Transmission Protocol for Vehicular Ad Hoc Networks

Vehicular Ad hoc Networks(VANETs)become a very crucial addition in the Intelligent Transportation System(ITS).It is challenging for a VANET system to provide security services and parallelly maintain high throughput by utilizing limited resources.To overcome these challenges,we propose a blockchain-based Secured Cluster-based MAC(SCB-MAC)protocol.The nearby vehicles heading towards the same direction will form a cluster and each of the clusters has its blockchain to store and distribute the safety messages.The message which contains emergency information and requires Strict Delay Requirement(SDR)for transmission are called safety messages(SM).Cluster Members(CMs)sign SMs with their private keys while sending them to the blockchain to confirm authentication,integrity,and confidentiality of the message.A Certificate Authority(CA)is responsible for physical verification,key generation,and privacy preservation of the vehicles.We implemented a test scenario as proof of concept and tested the safety message transmission(SMT)protocol in a real-world platform.Computational and storage overhead analysis shows that the proposed protocol for SMT implements security,authentication,integrity,robustness,non-repudiation,etc.while maintaining the SDR.Messages that are less important compared to the SMs are called non-safety messages(NSM)and vehicles use RTS/CTS mechanism for NSM transmission.Numerical studies show that the proposed NSM transmission method maintains 6 times more throughput,2 times less delay and 125%less Packet Dropping Rate(PDR)than traditional MAC protocols.These results prove that the proposed protocol outperforms the traditional MAC protocols.

Secure and Energy Concise Route Revamp Technique in Wireless Sensor Networks

Energy conservation has become a significant consideration in wireless sensor networks(WSN).In the sensor network,the sensor nodes have internal batteries,and as a result,they expire after a certain period.As a result,expanding the life duration of sensing devices by improving data depletion in an effective and sustainable energy-efficient way remains a challenge.Also,the clustering strategy employs to enhance or extend the life cycle of WSNs.We identify the supervisory head node(SH)or cluster head(CH)in every grouping considered the feasible strategy for power-saving route discovery in the clustering model,which diminishes the communication overhead in the WSN.However,the critical issue was determining the best SH for ensuring timely communication services.Our secure and energy concise route revamp technology(SECRET)protocol involves selecting an energy-concise cluster head(ECH)and route revamping to optimize navigation.The sensors transmit information over the ECH,which delivers the information to the base station via the determined optimal path using our strategy for effective data transmission.We modeled our methods to accom-plish power-efficient multi-hop routing.Furthermore,protected navigation helps to preserve energy when routing.The suggested solution improves energy savings,packet delivery ratio(PDR),route latency(RL),network lifetime(NL),and scalability.

Multipath Grid-Based Enabled Geographic Routing for Wireless Sensor Networks

This work proposes an efficient disjoint multipath geographic routing algorithm for dense wireless sensor networks (WSN), called Multipath Grid-based Enabled Geographic Routing (MGEGR). The proposed algorithm relies on the construction of a 2-D logical grid in the geographical region of deployment. The objective of the proposed scheme is to determine optimal or near-optimal (within a defined constant) multiple disjoint paths (multipath) from a source node to the sink, in order to enhance the reliability of the network. The determined multiple disjoint paths would be used by the source node in a round-robin way to balance the traffic across the disjoint paths, and to avoid discovered paths with cell holes. The proposed scheme limits the use of broadcasting to the process of gateway election within each cell, and the process of maintaining the table of neighbors of each gateway. Our simulation results show the effectiveness and scalability of our routing scheme with increased network size compared to on-demand routing protocols.

Range-Based Localization in Wireless Networks Using Density-Based Outlier Detection

Node localization is commonly employed in wireless networks. For example, it is used to improve routing and enhance security. Localization algorithms can be classified as range-free or range-based. Range-based algorithms use location metrics such as ToA, TDoA, RSS, and AoA to estimate the distance between two nodes. Proximity sensing between nodes is typically the basis for range-free algorithms. A tradeoff exists since range-based algorithms are more accurate but also more complex. However, in applications such as target tracking, localization accuracy is very important. In this paper, we propose a new range-based algorithm which is based on the density-based outlier detection algorithm (DBOD) from data mining. It requires selection of the K-nearest neighbours (KNN). DBOD assigns density values to each point used in the location estimation. The mean of these densities is calculated and those points having a density larger than the mean are kept as candidate points. Different performance measures are used to compare our approach with the linear least squares (LLS) and weighted linear least squares based on singular value decomposition (WLS-SVD) algorithms. It is shown that the proposed algorithm performs better than these algorithms even when the anchor geometry about an unlocalized node is poor.

A Novel Range-Free Jammer Localization Solution in Wireless Network by Using PSO Algorithm

In wireless networks, jamming attacks are easy to launch and can significantly impact the network performance. The technique which localizes the jamming attacker is useful to address this problem. Some range-based localization schemes depend on the additional hardware of wireless nodes too much, and they can not work in resource-constrained wireless networks. Solutions in range-free localization are being pursued as a cost-effective alternative to more expensive range-based approaches.In this paper, we propose a novel range-free algorithm to localize the source of the attacker. We show that our approach only relies on the positions of each jammed or no-jammed node in the network, PSO algorithm is used to get the minimum covering circle of jammed positions and the circle center is the estimated jammer location. We compare our work with some existing range-free solutions via extensive simulations in two models, which are wireless sensor network (WSN) and vehicular ad hoc network (VANET) respectively. The experimental results suggest that our proposed algorithm achieves higher accuracy than the other solutions, and the localization error goes down with larger number of recorded jammed positions. In additional, when the recorded jammed positions are distributed in a specific constrained area, the localization error goes higher, we also propose an improved PSO algorithm to deal with this issue.

Remote monitoring system for livestock environmental information based on LoRa wireless ad hoc network technology

The environmental quality of livestock houses is key to livestock breeding and directly affects the growth and health of animals.To target the characteristics of long application cycles and large coverage areas for environmental monitoring in large-scale livestock breeding,the current study designed a remote monitoring system to provide livestock environmental information based on LoRa wireless ad hoc network technology.The system consisted of collection terminals,control terminals,LoRa gateways,and Alibaba Elastic Compute Service.It realized real-time collection,wireless transmission,storage of multi-sensor node data,and remote control.The system was not limited by the selected time or region,because data interaction was achieved by accessing cloud servers using GPRS technology.Users could browse and obtain data from computers and a WeChat mini program from any location with network coverage.Additionally,the system used the improved receiver-based auto rate(RBAR)rate-adaptive algorithm in the LoRa wireless communication component.After application on a dairy farm,the results showed that the whole system collected 6140 sets of environmental data from four dairy houses.The packet loss rate was less than 1%within a communication distance of 604 m,and the communication success rate was greater than 99%.The control instructions were real-time and accurate,and the response time was less than 10 s,which met the remote control needs of large farms.The system provided powerful data and technical support for precision animal production.

A survey on trust based detection and isolation of malicious nodes in ad-hoc and sensor networks

Mobile ad-hoc networks （MANETs） and wireless sensor networks （WSNs） have gained remarkable apprecia- tion and technological development over the last few years. Despite ease of deployment, tremendous applications and significant advantages, security has always been a challeng- ing issue due to the nature of environments in which nodes operate. Nodes＇ physical capture, malicious or selfish behav- ior cannot be detected by traditional security schemes. Trust and reputation based approaches have gained global recog- nition in providing additional means of security for decision making in sensor and ad-hoc networks. This paper provides an extensive literature review of trust and reputation based models both in sensor and ad-hoc networks. Based on the mechanism of trust establishment, we categorize the state- of-the-art into two groups namely node-centric trust mod- els and system-centric trust models. Based on trust evidence, initialization, computation, propagation and weight assign- ments, we evaluate the efficacy of the existing schemes. Fi- nally, we conclude our discussion with identification of some unresolved issues in pursuit of trust and reputation manage- ment.

Semi Markov process inspired selfish aware co-operative scheme for wireless sensor networks(SMPISCS)

In Wireless Sensor Network(WSN),energy and packet forwarding tendencies of sensor nodes plays a potential role in ensuring a maximum degree of co-operation under data delivery.This quantified level of co-operation signifies the performance of the network in terms of increased throughput,packet delivery rate and decreased delay depending on the data being aggregated and level of control overhead.The performance of a sensor network is highly inclined by the selfish behaving nature of sensor nodes that gets revealed when the residual energy ranges below a bearable level of activeness in packet forwarding.The selfish sensor node needs to be identified in future through reliable forecasting mechanism for improving the lifetime and packet delivery rate.Semi Markov Process Inspired Selfish aware Co-operative Scheme(SMPISCS)is propounded for making an attempt to mitigate selfish nodes for prolonging the lifetime of the network and balancing energy consumptions of the network.SMPISCS model provides a kind of sensor node’s behavior for quantifying and future forecasting the probability with which the node could turn into selfish.Simulation experiments are carried out through Network Simulator 2 and the performance are analyzed based on varying the number of selfish sensor nodes,number of sensor nodes and range of detection threshold.

Semi Markov process inspired selfish aware co-operative scheme for wireless sensor networks(SMPISCS)

In Wireless Sensor Network(WSN),energy and packet forwarding tendencies of sensor nodes plays a potential role in ensuring a maximum degree of co-operation under data delivery.This quantified level of co-operation signifies the performance of the network in terms of increased throughput,packet delivery rate and decreased delay depending on the data being aggregated and level of control overhead.The performance of a sensor network is highly inclined by the selfish behaving nature of sensor nodes that gets revealed when the residual energy ranges below a bearable level of activeness in packet forwarding.The selfish sensor node needs to be identified in future through reliable forecasting mechanism for improving the lifetime and packet delivery rate.Semi Markov Process Inspired Selfish aware Co-operative Scheme(SMPISCS)is propounded for making an attempt to mitigate selfish nodes for prolonging the lifetime of the network and balancing energy consumptions of the network.SMPISCS model provides a kind of sensor node’s behavior for quantifying and future forecasting the probability with which the node could turn into selfish.Simulation experiments are carried out through Network Simulator 2 and the performance are analyzed based on varying the number of selfish sensor nodes,number of sensor nodes and range of detection threshold.

A novel mathematical model for coverage in wireless sensor network

Coverage problem is one of the fundamental issues in the design of wireless sensor network, which has a great impact on the performance of sensor network. In this article, coverage problem was investigated using a mathematical model named Birth-death process. In this model, sensor nodes joining into networks at every period of time is considered as the rebirth of network and the quitting of sensor nodes from the networks is considered as the death of the network. In the end, an analytical solution is used to investigate the appropriate rate to meet the coverage requirement.

Reliable Multi-path Routing in Selfish Networks with Hidden Information and Actions

In this paper, we propose a novel game-theoretical solution to the multi-path routing problem in wireless ad hoc networks comprising selfish nodes with hidden information and actions. By incorporating a suitable traffic allocation policy, the proposed mechanism results in Nash equilibria where each node honestly reveals its true cost, and forwarding subgame perfect equilibrium in which each node does provide forwarding service with its declared service reliability. Based on the generalised second price auction, this mechanism effectively alleviates the over-payment of the well-known VCG mechanism. The effectiveness of this mechanism will be shown through simulations.

无线Ad hoc网络及其研究难点

无线Adhoc网络作为没有基础设施的网络 ,在军事和民用方面具有广阔的应用前景 ,是目前网络研究中的热点问题。本文对无线Adhoc网络进行了详细的论述 。

Ad Hoc网络和无线传感器网络中连通支配集的分布式构造(英文)

Ad hoc网络和无线传感器网络具有广泛的应用,但对于这样自组性的网络须采用分层结构的聚簇来有效管理.通过选择具有支配属性的节点构成虚拟主干以支持路由、广播及覆盖等应用.大部分的研究都集中在高效选择较小的连通支配集.全面阐述了连通支配集构造的研究进展,并依据不同的网络假设、设计目标和性能对超过20种连通支配集的构造算法进行分类和总结.指出这一领域的研究方向.

移动Ad hoc网络安全分簇综述

移动Ad hoc网络是由移动节点组成的无线移动通信网络,它具有动态拓扑、无线通信的特点,但又易受到各种安全威胁。规模较大的移动Ad hoc网络可以用分簇的方法来减少路由和控制开销,并提高网络的可扩充性。综合分析了以安全为部分或全部目的的移动Ad hoc网络分簇方法研究的最新进展。首先分析了移动Ad hoc网络的特点、体系结构和面临的安全威胁,然后将较大规模移动Ad hoc网络的安全分簇方法分为3个重要方面:认证模型、信任度量和不良节点发现。对每个方面的一些典型方案进行了分类论述和综合比较。最后指出了下一步研究中应当着重考虑的问题。

基于Ad hoc技术的矿井无线传感器网络的研究与设计

应用Ad hoc技术设计了矿井无线传感器网络系统,该网络可用于采集井下瓦斯浓度、矿井壁上土层压力等数据,并可迅速把采集到的数据传输到地面。文章还介绍了系统的整体结构,针对系统的物理层节点构成、MAC层协议给出了具体的设计方法。最后说明了该系统的局限性及应注意的事项。

无线Ad hoc网络中基于身份的密钥管理方案

基于身份的密码体制(ID-based cryptography)是SHAM IR在1984年提出的,使用该体制进行加密、签名和认证可以有效地减小系统中用户的存储代价和运算量.将其应用到无线Ad hoc网络中,提出了一个基于身份的密钥管理方案.它采用基于身份的密码体制、秘密分享技术来实现私钥的分布式生成,并且利用盲短签名机制有效地实现了私钥的安全分发.该新方案可满足无线Ad hoc网络中密钥的安全需求,同时能节省网络资源、提高网络性能.

Ad Hoc网络连通度的研究

连通度是Ad Hoc网络的根本属性。保持网络的连通性对于提高网络的吞吐量至关重要。目前的研究主要以概率论方法为理论基础,讨论节点临界的传输范围以及节点的平均度在什么情况下,保持Ad Hoc网络的k连通。首先对Ad Hoc网络连通度目前的研究进展进行了综述,其次在引入能量模型的基础上,对Ad Hoc网络的连通度进行了仿真,基于仿真结果指出了相关文献的不足之处,最后对将来的研究方向进行了展望。