NanoSD: A Flexible Service Discovery Protocol for Dynamic and Heterogeneous Wireless Sensor Networks

2010 ◽  
Author(s):  
A Kovacevic ◽  
J Ansari ◽  
P Mahonen
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Service Discovery ◽  
Wireless Sensor ◽  
Heterogeneous Wireless Sensor Networks ◽  
Service Discovery Protocol

scholarly journals An Evaluation of Topology Effect on Tiny Service Discovery Protocol for Wireless Sensor Networks

2016 ◽  
Vol 15 (3) ◽  
pp. 6632-6642
Author(s):  
Khalid Kahloot ◽  
Akram A. ElKhatib
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Waiting Time ◽  
Service Discovery ◽  
Throughput Capacity ◽  
Wireless Sensor ◽  
Average Waiting Time ◽  
Sensor Applications ◽  
Success Ratio ◽  
Service Discovery Protocol

In the literature of wireless sensor networks (WSNs), a well studied problem is that of achieving full sevice discovery within a region according to the topology model of coverage. A large waiting time of wireless sensor applications spent in node discovery, as nodes need to periodically advertise their presence and be awake to discover other nodes for services. Uniformly random distributions are widely accepted models for the location of the nodes in WSNs. Depending on the application, it may also be possible to place sensors in a four models of topologies; random, square, tringle and hexagon. There is a rich literature on throughput capacity for WSNs topologies in general, but we want to specifically study Service Discovery Protocol and how proper node deployment scheme can reduce the complexity of problems. In this paper, the effect of node topology on the performance of Tiny Service Discovery Protocol (TinySDP) in WSNs has been analyzed. In order to measure and evaluate the performance of TinySDP within variant shapes of topologies, We compared in terms of success ratio, number of transmitted messages and average waiting time. Simulation results showed that hexagon topology has a high data success ratio and a very low average waiting time, which are major requirements for disaster management scenarios.  

scholarly journals An Evaluation of Mobility Effect on Tiny Service Discovery Protocol for Wireless Sensor Networks

2014 ◽  
Vol 14 (1) ◽  
pp. 5312-5322
Author(s):  
Ahmed Salim ◽  
Akram El Khatib
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Waiting Time ◽  
Service Discovery ◽  
Wireless Sensor ◽  
Node Mobility ◽  
Average Waiting Time ◽  
Sensor Applications ◽  
Success Ratio ◽  
Service Discovery Protocol

In mobile sensors environment, nodes change their positions this leads to crucially affects service discovery of wireless sensor networks (WSNs). Therefor the accuracy of most service discovery can be limited to just small area of movement, or demands considerable maintenance efforts in term of neighbor nodes allocation. A large waiting time of wireless sensor applications spent in node discovery, as nodes need to periodically advertise their presence and be awake to discover other nodes for services. The optimization of waiting time, which is generally a hard task in static wireless sensor networks, is even harder in mobile wireless sensor networks, where the neighboring nodes also change over time. In this paper, the effect of node mobility on the performance of Tiny Service Discovery Protocol (TinySDP) in WSNs has been analyze. In order to measure and evaluate the performance of TinySDP in mobile WSNs (MWSN), three major metrics of evaluation has been considered such as, Success ratio, Number of transmitted messages and Average waiting time. Simulation results show that the success ratio and average waiting time of TinySDP in mobile WSNs had decreased and the number of transmitted message increased.

Sign in / Sign up

Export Citation Format

Share Document