50 research outputs found
Information distribution and recharging dispatch strategy in large wireless networks
Large wireless networks are envisioned to play increasingly important roles as more and more mobile wireless devices and Internet of Things (IoT) devices are put in use. In these networks, it is often the case that some critical information needs to be readily accessible, requiring a careful design of the information distribution technique. In this work, we at first propose PeB, Periodic Broadcast, that takes advantage of periodic broadcast from the information server(s) to leave traces for nodes requesting for the information while maintaining a low overhead. Similar to swarm intelligence, PeB requires each node to keep track of traces, or past records of information flow, through itself toward information servers. We present our extensive investigation of the PeB scheme on cost and network dynamics as compared to other state-of-the-art techniques. When the devices run out of battery, they become static and need to be recharged by the wireless charging vehicles (WCVs). Often times, WCV receives a number of charging requests and form a Hamiltonian cycle and visit these nodes one-by-one. We also propose a heuristic algorithm, termed Quad, that generates a Hamiltonian cycle in a square plane. We then focus on the theoretical study of the length of the Hamiltonian cycles in such networks
Ant-based evidence distribution with periodic broadcast in attacked wireless network
In order to establish trust among nodes in large wireless networks, the trust certicates need to be distributed and be readily accessible. However, even so, searching for trust certicates will still become highly cost and delay especially when wireless network is suering CTS jamming attack. We believe the individual solution can lead us to solve this combination problems in the future. Therefore, in this work, we investigate the delay and cost of searching a distributed certicate and the adverse eects of fabiricated control packet attacks on channel throughput and delivery ratio respectively, and propose two techniques that can improve the eciency of searching for such certicates in the network and mitigate the CTS jamming attack's eect. Evidence Distribution based on Periodic Broadcast (EDPB) is the rst solution we presented to help node to quickly locate trust certicates in a large wireless sensor network. In this solution, we not only take advantages from swarm intelligence alogrithm, but also allow nodes that carrying certicates to periodically announce their existence. Such announcements, together with a swarm-intelligence pheromone pdate procedure, will leave traces on the nodes to lead query packets toward the certicate nodes. We then investigate the salient features of this schema and evaluate its performance in both static and mobile networks. This schema can also be used for other essential information dissemination in mobile ad hoc networks. The second technqiue, address inspection schema (AIS) xes vulnerabilities exist in distribution coordinating function (DCF) dened in IEEE 802.11 standard so that each node has the ability to beat the impact of CTS jamming attack and furthermore, benets network throughput. We then perform ns-2 simulations to evaluate the benet of AIS
A Quality Hybrid Service Discovery Protocol
Hybrid protocol combines the advantages of proactive and reactive routing in adhoc network. The routing is initially established with some proactively prospected routes and then serves the demand from additionally activated nodes through reactive flooding. In this paper we propose A Quality Hybrid Service Discovery Protocol (QHSDP) for discovering services. A broadcast mechanism is used to get the service and routing information of the nodes present inside the zone. The routing and service information reduces the packet flooding in the network hence reducing collision and increasing packet delivery efficiency. Reduced control packets in turn reduces the battery power consumption. A query message is bordercasted through the peripheral nodes to the nodes outside the zone. This makes the discovery procedure more sclable, hence increasing the node’s coverage and reducing the latency in the proposed technology compared to the existing technolog
A Comprehensive Survey on Routing and Security in Mobile Wireless Sensor Networks
With the continuous advances in mobile wirelesssensor networks (MWSNs), the research community hasresponded to the challenges and constraints in the design of thesenetworks by proposing efficient routing protocols that focus onparticular performance metrics such as residual energy utilization,mobility, topology, scalability, localization, data collection routing,Quality of Service (QoS), etc. In addition, the introduction ofmobility in WSN has brought new challenges for the routing,stability, security, and reliability of WSNs. Therefore, in thisarticle, we present a comprehensive and meticulous investigationin the routing protocols and security challenges in the theory ofMWSNs which was developed in recent years
Recommended from our members
Optimising routing and trustworthiness of ad hoc networks using swarm intelligence
This thesis was submitted for the degree of Doctor of Philsophy and awarded by Brunel UniversityThis thesis proposes different approaches to address routing and security of MANETs using swarm technology. The mobility and infrastructure-less of MANET as well as nodes misbehavior compose great challenges to routing and security protocols of such a network. The first approach addresses the problem of channel assignment in multichannel ad hoc networks with limited number of interfaces, where stable route are more preferred to be selected. The channel selection is based on link quality between the nodes. Geographical information is used with mapping algorithm in order to estimate and predict the links’ quality and routes life time, which is combined with Ant Colony Optimization (ACO) algorithm to find most stable route with high data rate. As a result, a better utilization of the channels is performed where the throughput increased up to 74% over ASAR protocol. A new smart data packet routing protocol is developed based on the River Formation Dynamics (RFD) algorithm. The RFD algorithm is a subset of swarm intelligence which mimics how rivers are created in nature. The protocol is a distributed swarm learning approach where data packets are smart enough to guide themselves through best available route in the network. The learning information is distributed throughout the nodes of the network. This information can be used and updated by successive data packets in order to maintain and find better routes. Data packets act like swarm agents (drops) where they carry their path information and update routing information without the need for backward agents. These data packets modify the routing information based on different network metrics. As a result, data packet can guide themselves through better routes.
In the second approach, a hybrid ACO and RFD smart data packet routing protocol is developed where the protocol tries to find shortest path that is less congested to the destination. Simulation results show throughput improvement by 30% over AODV protocol and 13% over AntHocNet. Both delay and jitter have been improved more than 96% over AODV protocol. In order to overcome the problem of source routing introduced due to the use of the ACO algorithm, a solely RFD based distance vector protocol has been developed as a third approach. Moreover, the protocol separates reactive learned information from proactive learned information to add more reliability to data routing. To minimize the power consumption introduced due to the hybrid nature of the RFD routing protocol, a forth approach has been developed. This protocol tackles the problem of power consumption and adds packets delivery power minimization to the protocol based on RFD algorithm.
Finally, a security model based on reputation and trust is added to the smart data packet protocol in order to detect misbehaving nodes. A trust system has been built based on the privilege offered by the RFD algorithm, where drops are always moving from higher altitude to lower one. Moreover, the distributed and undefined nature of the ad hoc network forces the nodes to obligate to cooperative behaviour in order not to be exposed. This system can easily and quickly detect misbehaving nodes according to altitude difference between active intermediate nodes
SRP-HEE: A Modified Stateless Routing Protocol based on Homomorphic Energy based Encryption for Wireless Sensor Network
Due to the wireless nature, the sensors node data are prone to location privacy of source and classification of the packet by unauthorized parties. Data encryption is one of the most effective ways to thwart unauthorized access to the data and trace information. Traditional wireless network security solutions are not viable for WSNs In this paper, a novel distributed forward aware factor based heuristics towards generating greedy routing using stateless routing is SRP-HEE for wireless sensor network. The model employs the homomorphic Energy based encryption technique. Energy based Encryption model is devoted as homomorphic mechanism due to their less computational complexity. Additionally, privacy constraint becoming a critical issue in the wireless sensor networks (WSNs) because sensor nodes are generally prone to attacks which deplete energy quickly as it is exposed to mobile sink frequently for data transmission. Through inclusion of the Forward aware factor on the Greedy routing strategies, it is possible to eliminate the attacking node which is depleting the energy of the source node. Heuristic conditions are used for optimizing the sampling rate and battery level for tackling the battery capacity constraints of the wireless sensor nodes. The Node characteristics of the propagating node have been analysed utilizing kalman filter and linear regression. The cooperative caching of the network information will enable to handle the fault condition by changing the privacy level of the network. The Simulation results demonstrate that SRP-HEE model outperforms existing technique on basis of Latency, Packet Delivery Ratio, Network Overhead, and Energy Utilization of nodes
A Secure Group Communication Architecture for Autonomous Unmanned Aerial Vehicles
This paper investigates the application of a secure group communication architecture to a swarm of autonomous unmanned aerial vehicles (UAVs). A multicast secure group communication architecture for the low earth orbit (LEO) satellite environment is evaluated to determine if it can be effectively adapted to a swarm of UAVs and provide secure, scalable, and efficient communications. The performance of the proposed security architecture is evaluated with two other commonly used architectures using a discrete event computer simulation developed using MATLAB. Performance is evaluated in terms of the scalability and efficiency of the group key distribution and management scheme when the swarm size, swarm mobility, multicast group join and departure rates are varied. The metrics include the total keys distributed over the simulation period, the average number of times an individual UAV must rekey, the average bandwidth used to rekey the swarm, and the average percentage of battery consumed by a UAV to rekey over the simulation period. The proposed security architecture can successfully be applied to a swarm of autonomous UAVs using current technology. The proposed architecture is more efficient and scalable than the other tested and commonly used architectures. Over all the tested configurations, the proposed architecture distributes 55.2–94.8% fewer keys, rekeys 59.0–94.9% less often per UAV, uses 55.2–87.9% less bandwidth to rekey, and reduces the battery consumption by 16.9–85.4%
Hybrid Swarm Intelligence Energy Efficient Clustered Routing Algorithm for Wireless Sensor Networks
Currently, wireless sensor networks (WSNs) are used in many applications, namely, environment monitoring, disaster management, industrial automation, and medical electronics. Sensor nodes carry many limitations like low battery life, small memory space, and limited computing capability. To create a wireless sensor network more energy efficient, swarm intelligence technique has been applied to resolve many optimization issues in WSNs. In many existing clustering techniques an artificial bee colony (ABC) algorithm is utilized to collect information from the field periodically. Nevertheless, in the event based applications, an ant colony optimization (ACO) is a good solution to enhance the network lifespan. In this paper, we combine both algorithms (i.e., ABC and ACO) and propose a new hybrid ABCACO algorithm to solve a Nondeterministic Polynomial (NP) hard and finite problem of WSNs. ABCACO algorithm is divided into three main parts: (i) selection of optimal number of subregions and further subregion parts, (ii) cluster head selection using ABC algorithm, and (iii) efficient data transmission using ACO algorithm. We use a hierarchical clustering technique for data transmission; the data is transmitted from member nodes to the subcluster heads and then from subcluster heads to the elected cluster heads based on some threshold value. Cluster heads use an ACO algorithm to discover the best route for data transmission to the base station (BS). The proposed approach is very useful in designing the framework for forest fire detection and monitoring. The simulation results show that the ABCACO algorithm enhances the stability period by 60% and also improves the goodput by 31% against LEACH and WSNCABC, respectively
Improvement of cluster head selection in leach protocol of wireless sensor network
WSNs suffer from many issues such as coverage, security, energy-efficiency and localization. Among these issues, energy-efficiency is the most critical, as sensor nodes are battery operated, hence the need to optimize energy. Clustering technique has shown to be more suitable for energy efficiency, which is why LEACH protocol is considered. Despite that, the LEACH algorithm shows some drawbacks in the area of energy efficiency that needs to be enhanced in order to improve its performance. Therefore, since routing, communication and broadcasting between the nodes are done by the cluster heads, a modification in the LEACH algorithm was proposed where the improvement was done in cluster head selection to reduce the energy consumption. In this thesis, unlike the LEACH which uses the residual energy of the entire network, the cluster head selection takes into account the residual energy of each node to calculate the threshold value for next round. The cluster head selection uses a modified stochastic algorithm- the deterministic algorithm which calculates the residual energy of each node after each round to select the node with the highest residual energy as the cluster head. This approach makes the clustering algorithm adaptive to network dynamics as each node is considered to be a cluster head at a point. For simulation, the approach is implemented with LEACH in OMNET++ with Castalia and the results show that there is 3% increase in network lifetime
A Secure Group Communication Architecture for Autonomous Unmanned Aerial Vehicle
This paper investigates the application of a secure group communication architecture to a swarm of autonomous unmanned aerial vehicles (UAVs). A multicast secure group communication architecture for the low earth orbit (LEO) satellite environment is evaluated to determine if it can be effectively adapted to a swarm of UAVs and provide secure, scalable, and efficient communications. The performance of the proposed security architecture is evaluated with two other commonly used architectures using a discrete event computer simulation developed using MATLAB. Performance is evaluated in terms of the scalability and efficiency of the group key distribution and management scheme when the swarm size, swarm mobility, multicast group join and departure rates are varied. The metrics include the total keys distributed over the simulation period, the average number of times an individual UAV must rekey, the average bandwidth used to rekey the swarm, and the average percentage of battery consumed by a UAV to rekey over the simulation period. The proposed security architecture can successfully be applied to a swarm of autonomous UAVs using current technology. The proposed architecture is more efficient and scalable than the other tested and commonly used architectures. Over all the tested configurations, the proposed architecture distributes 55.2–94.8% fewer keys, rekeys 59.0–94.9% less often per UAV, uses 55.2–87.9% less bandwidth to rekey, and reduces the battery consumption by 16.9–85.4%