Federated Graph Learning for Low Probability of Detection in Wireless Ad-Hoc Networks

Low probability of detection (LPD) has recently emerged as a means to enhance the privacy and security of wireless networks. Unlike existing wireless security techniques, LPD measures aim to conceal the entire existence of wireless communication instead of safeguarding the information transmitted from users. Motivated by LPD communication, in this paper, we study a privacy-preserving and distributed framework based on graph neural networks to minimise the detectability of a wireless ad-hoc network as a whole and predict an optimal communication region for each node in the wireless network, allowing them to communicate while remaining undetected from external actors. We also demonstrate the effectiveness of the proposed method in terms of two performance measures, i.e., mean absolute error and median absolute error

Multi Hop Transmission in IEEE 802.11 Low Rate Ad Hoc Network Using ARP-Route

Ad hoc networks are becoming more important in the modern complex environment. The ad hoc network can be used to instantly connect to the local or remote networks such as the Internet without the need of pre-existing infrastructure or centralized administration. The users of the network together will establish the infrastructure. The disadvantage of wireless communication is that it has limited range of radio transmission. Due to this, multiple network ‘hops’ are needed for one device to exchange data with another device across the network. In an ad hoc network, these devices will not only operate as a host but also as a router to forward the packets. There are varieties of routing protocols targeted for this environment that have been proposed and developed. However, most of them suffer from high overhead data traffic. The main purpose of this project is to implement the ad hoc network with the existing network protocol that had already been used in network environment which is the Address Resolution Protocol (ARP). ARP was designed to announce or find MAC addresses. The novelty of this study is that we have extended the usage of the ARP protocol to act as routing protocol in wireless ad hoc network. The ARP route provides two new operation types, ARP Forward Request and ARP Forward Reply to allow the multihop transmission using intermediate nodes to forward the request and reply. These two operation types only used the current operation codes which are ‘0x0001’ for request and ‘0x0002’ for reply. This work on the routing protocol creates a new operation code for the ARP forwarding scheme which is ‘0x000c’ for forwarding. We have successfully managed to create a multi hop transmission in an ad hoc network by using the current existing operation code for the ARP forwarding. The work scope focus only on proving that the method can be applied hence it is not necessarily to prove the effectiveness of this proposed method yet. Therefore, the outcome of the study shows that the data can be sent through multi hop transmission until it reaches the destination. The 802.11b test-bed has been configured and the ARP routing protocol has been implemented for multi hop transmission. The experiment in the open space provides the comparison of environment with obstacles and without obstacles. We manage to get more than 50% of packet receive at a place with no obstacles and more than 45% in a place with obstacles. The proof of method is shown by using several graphs namely in terms of time, packet loss and also throughput

Secure location-aware communications in energy-constrained wireless networks

Wireless ad hoc network has enabled a variety of exciting civilian, industrial and military applications over the past few years. Among the many types of wireless ad hoc networks, Wireless Sensor Networks (WSNs) has gained popularity because of the technology development for manufacturing low-cost, low-power, multi-functional motes. Compared with traditional wireless network, location-aware communication is a very common communication pattern and is required by many applications in WSNs. For instance, in the geographical routing protocol, a sensor needs to know its own and its neighbors\u27 locations to forward a packet properly to the next hop. The application-aware communications are vulnerable to many malicious attacks, ranging from passive eavesdropping to active spoofing, jamming, replaying, etc. Although research efforts have been devoted to secure communications in general, the properties of energy-constrained networks pose new technical challenges: First, the communicating nodes in the network are always unattended for long periods without physical maintenance, which makes their energy a premier resource. Second, the wireless devices usually have very limited hardware resources such as memory, computation capacity and communication range. Third, the number of nodes can be potentially of very high magnitude. Therefore, it is infeasible to utilize existing secure algorithms designed for conventional wireless networks, and innovative mechanisms should be designed in a way that can conserve power consumption, use inexpensive hardware and lightweight protocols, and accommodate with the scalability of the network. In this research, we aim at constructing a secure location-aware communication system for energy-constrained wireless network, and we take wireless sensor network as a concrete research scenario. Particularly, we identify three important problems as our research targets: (1) providing correct location estimations for sensors in presence of wormhole attacks and pollution attacks, (2) detecting location anomalies according to the application-specific requirements of the verification accuracy, and (3) preventing information leakage to eavesdroppers when using network coding for multicasting location information. Our contributions of the research are as follows: First, we propose two schemes to improve the availability and accuracy of location information of nodes. Then, we study monitoring and detection techniques and propose three lightweight schemes to detect location anomalies. Finally, we propose two network coding schemes which can effectively prevent information leakage to eavesdroppers. Simulation results demonstrate the effectiveness of our schemes in enhancing security of the system. Compared to previous works, our schemes are more lightweight in terms of hardware cost, computation overhead and communication consumptions, and thus are suitable for energy-constrained wireless networks

A RADIAL BASIS NEURAL NETWORK CONTROLLER TO SOLVE CONGESTION IN WIRELESS SENSOR NETWORKS

In multihop networks, such as the Internet and the Mobile Ad-hoc Networks, routing is one of the most importantissues that has an important effect on the network’s performance. This work explores the possibility of using the shortest path routingin wireless sensor network . An ideal routing algorithm should combat to find an perfect path for data that transmitted within anexact time. First an overview of shortest path algorithm is given. Then a congestion estimation algorithm based on multilayerperceptron neural networks (MLP-NNs) with sigmoid activation function, (Radial Basis Neural Network Congestion Controller(RBNNCC) )as a controller at the memory space of the base station node. The trained network model was used to estimate trafficcongestion along the selected route. A comparison study between the network with and without controller in terms of: trafficreceived to the base station, execution time, data lost, and memory utilization . The result clearly shows the effectiveness of RadialBasis Neural Network Congestion Controller (RBNNCC) in traffic congestion prediction and control

Multi Hop Transmission in IEEE 802.11 Low Rate Ad Hoc Network Using ARP-Route

Ad hoc networks are becoming more important in the modern complex environment. The ad hoc network can be used to instantly connect to the local or remote networks such as the Internet without the need of pre-existing infrastructure or centralized administration. The users of the network together will establish the infrastructure. The disadvantage of wireless communication is that it has limited range of radio transmission. Due to this, multiple network ‘hops’ are needed for one device to exchange data with another deviceacross the network. In an ad hoc network, these devices will not only operate as a host but also as a router to forward the packets. There are varieties of routing protocols targeted for this environment that have been proposed and developed. However, most of them suffer from high overhead data traffic. The main purpose of this project is to implement the ad hoc network with the existing network protocol that had already been used in network environment which is the Address Resolution Protocol (ARP). ARPwas designed to announce or find MAC addresses. The novelty ofthis study is that we have extended the usage of the ARP protocol to act as routing protocol in wireless ad hoc network. The ARP route provides two new operation types, ARP Forward Request and ARP Forward Reply to allow the multihop transmission using intermediate nodes to forward the request and reply. These two operation types only used the current operation codes which are ‘0x0001’ for request and ‘0x0002’ for reply. This work onthe routing protocol creates a new operation code for the ARP forwarding scheme which is ‘0x000c’ for forwarding. We have successfully managed to create a multi hop transmission in anad hoc network by using the current existing operation code for the ARP forwarding. The work scope focus only on proving that the method can be applied hence it is not necessarily to prove the effectiveness of this proposed method yet. Therefore,the outcome of the study shows that the data can be sent through multi hop transmission until it reaches the destination. The 802.11btest-bed has been configured and the ARP routing protocol has been implemented for multi hop transmission. The experiment in the open space provides the comparison of environment with obstacles and without obstacles. We manage to get more than 50% of packet receive at a place with no obstacles and more than 45% in a place with obstacles. The proof of method is shown by using several graphs namely in terms of time, packet loss and also throughput

Lifetime Improvement in Wireless Sensor Networks via Collaborative Beamforming and Cooperative Transmission

Collaborative beamforming (CB) and cooperative transmission (CT) have recently emerged as communication techniques that can make effective use of collaborative/cooperative nodes to create a virtual multiple-input/multiple-output (MIMO) system. Extending the lifetime of networks composed of battery-operated nodes is a key issue in the design and operation of wireless sensor networks. This paper considers the effects on network lifetime of allowing closely located nodes to use CB/CT to reduce the load or even to avoid packet-forwarding requests to nodes that have critical battery life. First, the effectiveness of CB/CT in improving the signal strength at a faraway destination using energy in nearby nodes is studied. Then, the performance improvement obtained by this technique is analyzed for a special 2D disk case. Further, for general networks in which information-generation rates are fixed, a new routing problem is formulated as a linear programming problem, while for other general networks, the cost for routing is dynamically adjusted according to the amount of energy remaining and the effectiveness of CB/CT. From the analysis and the simulation results, it is seen that the proposed method can reduce the payloads of energy-depleting nodes by about 90% in the special case network considered and improve the lifetimes of general networks by about 10%, compared with existing techniques.Comment: Invited paper to appear in the IEE Proceedings: Microwaves, Antennas and Propagation, Special Issue on Antenna Systems and Propagation for Future Wireless Communication

Localized Support for Injection Point Election in Hybrid Networks

Ad-hoc networks, a promising trend in wireless technology, fail to work properly in a global setting. In most cases, self-organization and cost-free local communication cannot compensate the need for being connected, gathering urgent information just-in-time. Equipping mobile devices additionally with GSM or UMTS adapters in order to communicate with arbitrary remote devices or even a fixed network infrastructure provides an opportunity. Devices that operate as intermediate nodes between the ad-hoc network and a reliable backbone network are potential injection points. They allow disseminating received information within the local neighborhood. The effectiveness of different devices to serve as injection point differs substantially. For practical reasons the determination of injection points should be done locally, within the ad-hoc network partitions. We analyze different localized algorithms using at most 2-hop neighboring information. Results show that devices selected this way spread information more efficiently through the ad-hoc network. Our results can also be applied in order to support the election process for clusterheads in the field of clustering mechanisms.Comment: The Sixth International Conference on Networking (ICN 2007