A Survey of Addressing Algorithms for Wireless Sensor Networks

Ye, Fujun; Pan, Ruifang

doi:10.1109/wicom.2009.5304082

Cited by 20 publications

(7 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Applying the distance formula for finding the every node distance value with the help of sensors, nodes coordinate as showing in Figure 5, for example, distance between Z (coordinator) and T node. Z= (5,4) T=(2, 4) Similarly, the value of all remaining distance is also calculated, which is also shown in Figure 4, that is, d2=2, d3=1, d4=2, d5=2, d6=1, d7=2, d8=4, d9=5, d10=4, d11=5, d12=1, and d13=2, using sensor nodes coordinate and distance measurement formula we able to measure the distance between each node in a WSN area.…”

Section: Casementioning

confidence: 96%

“…[2,3] Especially, it must apply a network joining technique that is able to link every node in a big scale WSN with reduced power consumption. [4] Many of network joining techniques have been suggested to support trusty connection in internet applications (e.g., dynamic host configuration protocol and duplicate address detection). [5][6][7] Even so, because of the broadcast storm issue, may not be applied this technique and the energy may become not efficient and this will be wasted it, [8] appropriate protocols must be applied to solve the problem of rejoining isolated nodes with conserving energy.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Solving Isolated Nodes Problem in ZigBee Pro for Wireless Sensor Networks

Hasan

Kadhim

2019

Cihan U Erbil SCI J

View full text Add to dashboard Cite

Wireless sensor network based on the ZigBee protocol consists of many sensor devices. In some cases, the sensor nodes may turn to isolated node because random distribution, particularly when creating the network. In this research was suggested two cases to overcome on the isolated node problem, the first case had able to overcome this problem by distributing the isolated nodes on the router nodes that carry the least number of sensor nodes, it helps to minimize the computational overhead on router nodes too, while the second one is able to overcome this problem by calculating the distance between the isolated nodes and the routers and then adds these nodes to the nearest routers. Subsequently, this method helps to minimize the energy consumption. The results show our approach able to solve the problem of isolated nodes using these two methods and when compared between them turns out the second method is better In terms of energy consumption. In addition, we are able to make the network larger scale.

show abstract

Section: Casementioning

confidence: 96%

mentioning

confidence: 99%

Solving Isolated Nodes Problem in ZigBee Pro for Wireless Sensor Networks

Hasan

Kadhim

2019

Cihan U Erbil SCI J

View full text Add to dashboard Cite

show abstract

“…In literature, several solutions for IP address autoconfiguration have been proposed. The authors in [15] classify these solutions in three major groups: stateful, stateless and hybrid. In stateful address auto-configuration approaches, all nodes consult a logically centralized node or a set of distributed agents to obtain a valid IP address.…”

Section: Related Workmentioning

confidence: 99%

IoT Security via Address Shuffling: The Easy Way

Nizzi

Pecorella

Esposito

et al. 2019

IEEE Internet Things J.

View full text Add to dashboard Cite

Securing Internet of Things (IoT) devices and protecting their applications from privacy leaks is a challenge, due to their weak (computational and storage) capabilities, and their proximity with sensitive data. Considering the resourceconstrains of such devices, their long lifetime, and the intermittent connections, classical security approaches are often too difficult or impractical to apply. Moving Target Defense is an established technique whose goal is to lower the attack surface to malicious users by constantly modifying device footprint. Changing the address to an IoT device without privacy leaks is, however, a nontrivial task. In this paper, we propose a novel method to perform a network-wide (IP and MAC) address shuffling procedure, called Address Shuffling Algorithm with HMAC (AShA), which is simple to implement, and whose network overhead is minimal. To demonstrate its effectiveness, we analyze our approach via theoretical analysis and simulations. Our analysis shows how AShA parameters can be adapted to various network sizes while our simulations results show how AShA can be used to successfully perform a global collision-free address renewal on networks of more than 2000 nodes using 16-bit addresses.

show abstract

“…Each sensor has a predefined unique hardware ID address that is usually used as MAC address. A sensor network may use the hardware identifier for both MAC and network address or extract the network address from the MAC address [28], a choice that depends on the application and the sensor network interface. Here the address is a 48-bit IEEE MAC which is used for most IEEE 802 network technologies, including Ethernet, Bluetooth and WiFi.…”

Section: Broadcast Messagesmentioning

confidence: 99%

Analysis and Evaluation of anEnergy-Efficient Routing Protocol for WSNsCombining Source Routing and MinimumCost Forwarding

Miyandoab

Ferreira

Tavares

2019

JMM

View full text Add to dashboard Cite

Source routing (SR) minimum cost forwarding (MCF)-SRMCF-is a reactive, energy-efficient routing protocol proposed to improve the existent MCF methods utilized in heterogeneous wireless sensor networks (WSN). This paper presents an analytical analysis with experimental support that demonstrates the effectiveness of the proposed protocol. SRMCF stems from SR concepts and MCF methods exploited in ad hoc WSNs, where all unicast communications (between sensor nodes and the base station, or vice versa) use minimum cost paths. The protocol utilized in the present work was updated and now also handles link and node failures. Theoretical analysis and simulations show that the final protocol exhibits better throughput and energy consumption than MCF. Memory requirements for the routing table in the base station are also analyzed. Experimental results in a real scenario were obtained for implementations of both protocols, MCF and SRMCF, deployed in a small network of TelosB motes. Results show that SRMCF presents a 33% higher throughput and 24% less energy consumption than MCF. Extensive

show abstract

A Survey of Addressing Algorithms for Wireless Sensor Networks

Cited by 20 publications

References 37 publications

Solving Isolated Nodes Problem in ZigBee Pro for Wireless Sensor Networks

Solving Isolated Nodes Problem in ZigBee Pro for Wireless Sensor Networks

IoT Security via Address Shuffling: The Easy Way

Analysis and Evaluation of anEnergy-Efficient Routing Protocol for WSNsCombining Source Routing and MinimumCost Forwarding

Contact Info

Product

Resources

About