TSN-SLP: A Trusted Sybil Node-based Source Location Privacy Scheme using Evidence Theory in Underwater Sensor Networks

The size of mesh networks depends upon the usage scenario so that the use of any single routing algorithm alone, either proactive or reactive, may not work efficiently. This letter proposes a hybrid routing algorithm, where a different algorithm is applied depending on the hop count between source and destination nodes. The algorithm allows using a proactive algorithm when a destination is nearby and a reactive algorithm when a destination is away from a source node. In this letter, we adopt the Destination Sequenced Distance Vector routing protocol (DSDV) for a nearby destination and the Ad hoc On-Demand Vector routing protocol (AODV) for a remote destination. A node maintains only a shared routing table for routing protocols, which helps reducing the size of the routing table at a node within a mesh network. Its routing performance is compared to those in DSDV and AODV in terms of normalized routing load, average packet transmission delay, and the average number of entries in the routing table.

Ensuring source location privacy is crucial for the security of underwater acoustic sensor networks amid the growing use of marine environmental monitoring. However, the traditional source location privacy scheme overlooks multi-attacker cooperation strategies and also has the problem of high communication overhead. This paper addresses the aforementioned limitations by proposing an underwater source location privacy protection scheme based on game theory under the scenario of multiple cooperating attackers (SLP-MACGT). First, a transformation method of a virtual coordinate system is proposed to conceal the real position of nodes to a certain extent. Second, through using the relay node selection strategy, the diversity of transmission paths is increased, passive attacks by adversaries are resisted, and the privacy of source nodes is protected. Additionally, a secure data transmission technique utilizing fountain codes is employed to resist active attacks by adversaries, ensuring data integrity and enhancing data transmission stability. Finally, Nash equilibrium could be achieved after the multi-round evolutionary game theory of source node and multiple attackers adopting their respective strategies. Simulation experiments and performance evaluation verify the effectiveness and reliability of SLP-MACGT regarding aspects of the packet forwarding success rate, security time, delay and energy consumption: the packet delivery rate average increases by 30%, security time is extended by at least 85%, and the delay is reduced by at least 90% compared with SSLP, PP-LSPP, and MRGSLP.

Analytical average throughput and delay estimations for LTE uplink cell edge users

Improving the packet transmission delay is one of the major challenges of stochastic routing in wireless sensor networks: the use of random paths from source to destination nodes results in longer routes on average, which is not desirable in delay-sensitive applications. In this paper, we propose a novel distributed and decentralized stochastic routing algorithm to minimize the average packet transmission delay of the network. We also provide an analytical expression for the average packet transmission delay for a circular network using a discrete time Markov chain model and we discuss the performance improvement with respect to random walking methods. Simulation results demonstrate that our proposed routing method significantly improves the average packet transmission delay when compared to existing methods and provides a near optimal solution.

With the emergence of new applications in mobile networks, users demand higher network stability and lower data transmission delays. When the network address of a mobile user changes, the data transmission path in the wired network may need to be switched to maintain service continuity. Traditional mobility support methods typically rely on a single switching path for all mobile data flows. However, if this path cannot meet the requirements of all the flows, it may lead to network congestion or a decline in user experience. To overcome this limitation, this paper proposes a mobility handover decision method based on multi-topology. It enables the dynamic allocation of mobile data flows across different switching paths within multiple logical topologies. The method models a multi-topology selection problem aimed at minimizing average packet transmission delay and packet loss rate, while considering network conditions and the Quality of Service (QoS) requirements for each flow. By solving the dual problem of the original optimization, a near-optimal solution is achieved. The proposed scheme and algorithm were implemented and tested using the Mininet network simulator. Results show that the proposed approach achieves low average packet transmission delay, low average packet loss rate, and high throughput, compared to traditional single-path switching methods and existing multipath routing methods.

We present in this paper the analytical evaluation of a simple mechanism to reduce the average transmission delay of master stations in a network based on the Distributed Queuing MAC protocol for Ad hoc Networks (DQMAN). When DQMAN is executed, the network is self-organized into dynamic and spontaneous master-slave clusters. Within each cluster, a highperformance MAC protocol based on a tree-splitting collision resolution algorithm which uses access minislots is executed. By allowing temporary master stations to avoid contention to get access to the channel, their average packet transmission delay can be effectively reduced compared to that of slaves. This technique provides thus master stations with higher access priority to the channel and, indeed, could be used in any MAC protocol based on access minislots to provide a subset of users with higher priority.

In this paper, we research the performance of direct and non-direct multiple relays cooperative truncated automatic repeat request (D/ND-MRCT-ARQ) protocols in wireless sensor networks (WSNs). We propose a method that named discrete time Markov chain (DTMC) with N + 2 states, which could obtain the throughput formulas of D/ND-MRCT-ARQ protocols. Furthermore, we solve the mathematical expressions of the average transmission delay of both protocols by truncating the number of packet retransmission. In addition, we derive energy efficiency formulas of both protocols under considering the different power consumption of each node. Simulation results demonstrate that the proposed D-MRCT-ARQ protocol achieve higher throughput and energy efficiency while fewer average packet transmission delay, as compared with the ND-MRCT-ARQ protocol.

In this paper, the impact of user relaying on the behavior of a relay node, which acts as the source node at the same time, is analyzed in a wireless relay network at the packet level. The analysis process models the behavior of the relay node as a queueing system and represents the service for its own packet transmission as an M/G/1-type Markov chain. By considering the fact that the maximum number of packet arrivals is ordinarily limited in a practical system, the M/G/1-type Markov chain is further reformatted into a quasi-birth-death (QBD) process through re-blocking so as to simplify the analysis and obtain the associated performance, such as average packet transmission delay. As an application of the results arising from the analysis, a new relay node selection scheme, based on a utility function approach that jointly considers the channel and the queue conditions at the relay node, is proposed. Numerical results show that the proposed analysis model is quite accurate and the proposed relay node selection scheme is effective in balancing cooperative diversity gain and packet transmission delay.

Internet of things (IoT) in health care is gaining popularity in the field of research to improve quality in smart health care systems and applications. However, security and privacy of Smart Health (S-Health) data are the challenging issues due to Sybil attacks. Sybil attack is one of the most common attacks where a malicious node uses morphed identities to generate Sybil nodes. Sybil nodes can acquire an authorized node identity and misbehaves by affecting its routing information, incurs interruption on communication line and storage. One of the IoT based smart health methodology is Privacy-Aware Smart Health (PASH), in which policy hiding is used to protect the privacy of users. The major issues in PASH is expensive to implement in S-Health applications, also it does not deal with attribute revocation and node traceability. To addresses these issues, a novel SybilWatch Enhanced Privacy-Aware Smart Health (E-PASH) approach is proposed in this paper. This approach has three major phases such as initialization phase, secure communication and Sybil node detection. A Lightweight Encryption Algorithm (LEA) is used to transmit SHRs (Smart Health Record) in encrypted form using prime order grouping. A novel BlueTits Detection (BTD) algorithm is used in detection phase where cluster head gathers the recent activities of the suspicious user, and based on the gathered parameters (Master key and Last One-Time Authentication), the cluster head declares it as a Sybil node. As soon as Sybil node is detected, revised revocation list is shared with active users. The proposed approach is less expensive compared to the existing approach, it also supports attribute revocation and node traceability which are the major setbacks is PASH. Simulation results and comparison analysis shows that proposed SybilWatch is efficient and cost effective compared to the existing approach, the proposed approach yields high detection rate of 99.7% and also false positive rate is reduced to 1% in the smart health systems, which is better compared to the existing approaches.

In this paper, we study packet transmission scheduling for a network with bidirectional relaying links, where the relay station can use network coding to combine packets to multiple receivers and opportunistically decide the number of packets to be combined in each transmission. Two cases are considered, depending on whether nodes are allowed to overhear transmissions of each other. A constrained Markov decision process is first formulated with an objective to minimize the average delay of packet transmissions, subject to the maximum and average transmission power limits of the relay node. The complexity for solving the constrained Markov decision process (MDP) is prohibitively high, although the computational complexity for the no‐overhearing case can be greatly reduced. Heuristic schemes are then proposed, one applies to the general case, and another applies to only the no‐overhearing case. Numerical results demonstrate that the heuristic schemes can achieve close‐to‐optimum average packet transmission delay, and furthermore, the second scheme achieves lower maximum delay while keeping the same average packet transmission delay and relay node power consumption as the first one. Copyright © 2015 John Wiley & Sons, Ltd.

Wireless Sensor Networks (WSNs) experience two different patterns of traffic with different requirements: 1) Event-driven traffic from sensor nodes to the base-station (BS) in the form of single-path uni-cast packets, and 2) Query-driven traffic from BS to sensors that better matches multi-casting and generates multi-path traffic. In this paper, we propose SiMple, a unified algorithm to jointly route single- and multi-path packets in WSNs. SiMple establishes a square destination area to control the degree of path multiplicity as well as the number of intermediate nodes between the source and destination nodes. When performing single-path routing, SiMple considers the direct line connecting source and destination nodes to select the closest sensor node to the line as the next carrier of the packet. Otherwise, SiMple directs packets towards the destination node(s) by exploiting multiple disjoint routes where the number of disjoint routes is controlled by the source node. In addition, SiMple introduces virtual source nodes to hide the location of the real source node, which is needed in asset monitoring applications. The conducted extensive NS-2 simulation experiments for mixed single- and multi-path packets confirm that SiMple results in a higher performance level and consumes lower energy when compared to the case of using two separate algorithms to individually route event and query packets.

Wireless sensor networks (WSNs) consist of numerous small nodes that can sense, collect, and disseminate information for many different types of applications. One of these applications is subject tracking and monitoring, in which the monitored subjects often need protection. For instance, a WSN can be deployed to monitor the movement of a panda in a national park. The panda needs protection from different adversaries, such as hunters and poachers. An adversary might trace the messages in the WSN to find the source node that sensed the panda, with the final aim of killing the panda. Hence the question is: how do we hide the location of the source node from the adversary? This question is relevant in several of the scenarios related to this application, such as patient monitoring and battlefield surveillance. In other words, the problem is to provide privacy to the source node: source location privacy. In this paper, we provide a survey of the state of the art in source location privacy. We first discuss the key concepts in source location privacy, such as anonymity, unobservability, safety period, and capture likelihood. Then, we present an overview of the solutions that provide source location privacy within a WSN, in relation to the assumptions about the adversary's capabilities. In particular, we summarize the concepts and solutions, which are categorized based on the core techniques used to provide source location privacy. We mention the limitations of the algorithms as found in the literature, classify the solutions based on their approach, and provide an overview of the assumptions on the adversarial capabilities related to each solution.

Wireless sensor networks (WSNs) are deployed in sensitive applications, such as in military and asset monitoring. In these applications, it is important to ensure good source location privacy. This is owing to the open nature of WSNs and the easiness of an adversary to eavesdrop on sensor communication and back trace the location of the source node. This paper proposes a scheme to preserve the source location privacy based on random routing techniques. To achieve high privacy, packets are randomly routed from the source to the sink node through strategically positioned mediate or diversion nodes. The random selection of mediate or diversion nodes is location-based. Depending on the location of the source node, packets are forwarded through different regions of the network. The proposed scheme guarantees that successive packets are routed through very different routing paths and adversaries find it confusing to back trace them to the source node location. Simulation results demonstrate that the proposed scheme effectively confuses the adversary and provides higher source location privacy to outperform other routing-based source location privacy schemes.

SummaryVehicular ad hoc network (VANET) is a part of the intelligent transportation system (ITS) that provides safety and nonsafety applications. The high mobility of vehicles and the wireless communication environment in VANET makes it vulnerable to various attacks. One among them is the Sybil attack, where a Sybil attacker creates multiple fake identities called Sybil nodes that disrupt the functionality of VANET. Most of the existing solutions in the literature discuss identifying the Sybil nodes (virtual); very few works exist to determine the Sybil attacker (source node that generates Sybil nodes). In this paper, we propose a computation less heuristic approach that focuses on detecting the Sybil attacker and its Sybil nodes using signal strength measurements and Euclidean distance as the detection parameters. The central VANET server, Road Side Units (RSUs), and vehicles collaborate in the detection process, which improves the accuracy of our approach. The core of the approach is a reward‐based system, where the vehicle rewards are determined by collecting RSUs' feedback about the vehicle behavior. From simulation experiments, it is evident that our proposed approach achieves a maximum detection rate of 99.89% and a false positive rate of 0.012% than the existing techniques.

TCSLP: A trace cost based source location privacy protection scheme in WSNs for smart cities