RNST

2011 ◽  
pp. 230-257
Author(s):  
Guangjie Han ◽  
Wen Shen ◽  
Chuan Zhu ◽  
Lei Shu ◽  
Joel J.P.C. Rodrigues
Keyword(s):  
Sensor Networks ◽  
Real Time ◽  
Resource Limitation ◽  
Mobile Node ◽  
Sensor Nodes ◽  
Localization Error ◽  
Mobile Nodes ◽  
Two Phase ◽  
Position Information ◽  
The Real

The key problem of location service in indoor sensor networks is to quickly and precisely acquire the position information of mobile nodes. Due to resource limitation of the sensor nodes, some of the traditional positioning algorithms, such as Two-Phase Positioning (TPP) algorithm, are too complicated to be implemented and they can not provide the real-time localization of the mobile node. We analyze the localization error, which is produced when one tries to estimate the mobile node using trilateration method in the localization process. We draw the conclusion that the localization error is the least when three reference nodes form an equilateral triangle. Therefore, we improve the TPP algorithm and propose Reference Node Selection algorithm based on Trilateration (RNST), which can provide real-time localization service for the mobile nodes. Our proposed algorithm is verified by the simulation experiment. Based on the analysis of the acquired data and comparison with that of the TPP algorithm, we conclude that our algorithm can meet real-time localization requirement of the mobile nodes in an indoor environment, and make the localization error less than that of the traditional algorithm; therefore our proposed algorithm can effectively solve the real-time localization problem of the mobile nodes in indoor sensor networks.

Improving Area Coverage With Mobile Nodes in Wireless Sensor Networks

2021 ◽  
Vol 13 (1) ◽  
pp. 36-48
Author(s):  
Dhruvi Patel ◽  
Arunita Jaekel
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Sensor Node ◽  
Mobile Node ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Area Of Interest ◽  
Adequate Coverage ◽  
Considerable Work

Wireless sensor networks (WSN) consist of sensor nodes that detect relevant events in their vicinity and relay this information for further analysis. Considerable work has been done in the area of sensor node placement to ensure adequate coverage of the area of interest. However, in many applications it may not be possible to accurately place individual sensor nodes. In such cases, imprecise placement can result in regions, referred to as coverage holes, that are not monitored by any sensor node. The use of mobile nodes that can ‘visit' such uncovered regions after deployment has been proposed in the literature as an effective way to maintain adequate coverage. In this paper, the authors propose a novel integer linear programming (ILP) formulation that determines the paths the mobile node(s) should take to realize the specified level of coverage in the shortest time. The authors also present a heuristic algorithm that can be used for larger networks.

Improved DV-Hop Localization Scheme for Randomly Deployed WSNs

2020 ◽  
Vol 10 (1) ◽  
pp. 94-109 ◽  
Author(s):  
Rekha Goyat ◽  
Mritunjay Kumar Rai ◽  
Gulshan Kumar ◽  
Hye-Jin Kim ◽  
Se-Jung Lim
Keyword(s):  
Wireless Sensor Networks ◽  
Energy Consumption ◽  
Sensor Networks ◽  
Research Area ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Localization Error ◽  
Anchor Nodes ◽  
Least Energy ◽  
Range Free

Background: Wireless Sensor Networks (WSNs) is considered one of the key research area in the recent. Various applications of WSNs need geographic location of the sensor nodes. Objective: Localization in WSNs plays an important role because without knowledge of sensor nodes location the information is useless. Finding the accurate location is very crucial in Wireless Sensor Networks. The efficiency of any localization approach is decided on the basis of accuracy and localization error. In range-free localization approaches, the location of unknown nodes are computed by collecting the information such as minimum hop count, hop size information from neighbors nodes. Methods: Although various studied have been done for computing the location of nodes but still, it is an enduring research area. To mitigate the problems of existing algorithms, a range-free Improved Weighted Novel DV-Hop localization algorithm is proposed. Main motive of the proposed study is to reduced localization error with least energy consumption. Firstly, the location information of anchor nodes is broadcasted upto M hop to decrease the energy consumption. Further, a weight factor and correction factor are introduced which refine the hop size of anchor nodes. Results: The refined hop size is further utilized for localization to reduces localization error significantly. The simulation results of the proposed algorithm are compared with other existing algorithms for evaluating the effectiveness and the performance. The simulated results are evaluated in terms localization error and computational cost by considering different parameters such as node density, percentage of anchor nodes, transmission range, effect of sensing field and effect of M on localization error. Further statistical analysis is performed on simulated results to prove the validation of proposed algorithm. A paired T-test is applied on localization error and localization time. The results of T-test depicts that the proposed algorithm significantly improves the localization accuracy with least energy consumption as compared to other existing algorithms like DV-Hop, IWCDV-Hop, and IDV-Hop. Conclusion: From the simulated results, it is concluded that the proposed algorithm offers 36% accurate localization than traditional DV-Hop and 21 % than IDV-Hop and 13% than IWCDV-Hop.

scholarly journals Phone-Based Restaurant Recommendation System by Using Position Information and Association Rules

2012 ◽  
Vol 6-7 ◽  
pp. 783-789
Author(s):  
Jian Feng Dong ◽  
Tian Yang Dong ◽  
Jia Jie Yao ◽  
Ling Zhang
Keyword(s):  
Mobile Phone ◽  
Real Time ◽  
Association Rules ◽  
Recommendation System ◽  
Rapid Development ◽  
Smart Phone ◽  
Smart Phones ◽  
Location Information ◽  
Position Information ◽  
The Real

With the rapid development of smart-phone applications, how to make the ordering process via smart-phones more convenient and intelligent has become a hotspot. This paper puts forward a method of restaurant dish recommendation relying on position information and association rules. In addition, this paper has designed and developed a restaurant recommendation system based on mobile phone. The system would fetch the real-time location information via smart-phones, and provide customers personalized restaurant and dish recommendation service. According to the related applications, this system can successfully recommend the related restaurants and food information to customers.

scholarly journals Using Mobile Elements as Dynamic Bridges in Sparse Wireless Sensor Networks

2014 ◽  
pp. 107
Author(s):  
Hoang Dang Hai ◽  
Thorsten Strufe ◽  
Pham Thieu Nga ◽  
Hoang Hong Ngoc ◽  
Nguyen Anh Son ◽  
...  
Keyword(s):  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Data Exchange ◽  
Data Transfer ◽  
Mobile Elements ◽  
Sensor Nodes ◽  
Pollution Monitoring ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Road Distance

Sparse  Wireless  Sensor  Networks  using several  mobile  nodes  and  a  small  number  of  static sensor  nodes  have  been  widely  used  for  many applications,  especially  for  traffic-generated  pollution monitoring.  This  paper  proposes  a  method  for  data collection and forwarding using Mobile Elements (MEs), which are moving on predefined trajectories in contrast to previous works that use a mixture of MEsand static nodes. In our method, MEscan be used as data collector as well as dynamic bridges for data transfer. We design the  trajectories  in  such  a  way,  that  they  completely cover  the  deployed  area  and  data  will  be  gradually forwarded  from  outermost  trajectories  to  the  center whenever  a  pair  of MEs contacts  each  other  on  an overlapping road distance of respective trajectories. The method  is based  on  direction-oriented  level  and  weight assignment.  We  analyze  the  contact  opportunity  for data  exchange  while MEs move.  The  method  has  been successfully tested for traffic pollution monitoring in an urban area.

Integration of Cognitive Radio Sensor Networks and Cloud Computing

2014 ◽  
pp. 288-312 ◽  
Author(s):  
Yasir Saleem ◽  
Farrukh Salim ◽  
Mubashir Husain Rehmani
Keyword(s):  
Cloud Computing ◽  
Cognitive Radio ◽  
Sensor Networks ◽  
Resource Limitation ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Future Directions ◽  
Cognitive Radio Sensor Networks ◽  
Computational Speed ◽  
Is Integration

Cognitive Radio Sensor Networks (CRSNs) are composed of sensor nodes equipped with Cognitive Radio (CR) technology with limited resources (e.g., storage, computational speed, bandwidth, security, etc.). In order to overcome resource limitation, cognitive radio sensor nodes are integrated with cloud computing, which provides computing resources (e.g., storage, computation, security, etc.) to sensor nodes. Therefore, the focus of this chapter is integration of cognitive radio sensor networks with cloud computing. In this chapter, the authors first provide background on cloud computing, cognitive radio networks, wireless sensor networks, and cognitive radio sensor networks. This chapter also describes benefits of this integration to both cognitive radio sensor networks and cloud computing, followed by advantages of using cloud computing in cognitive radio sensor networks. Furthermore, it provides applications of cloud-based cognitive radio sensor networks. In the end, the authors provide some issues, challenges, and future directions for such integration.

Integration of Cognitive Radio Sensor Networks and Cloud Computing

2015 ◽  
pp. 1025-1048
Author(s):  
Yasir Saleem ◽  
Farrukh Salim ◽  
Mubashir Husain Rehmani
Keyword(s):  
Cloud Computing ◽  
Cognitive Radio ◽  
Sensor Networks ◽  
Resource Limitation ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Future Directions ◽  
Cognitive Radio Sensor Networks ◽  
Computational Speed ◽  
Is Integration

Cognitive Radio Sensor Networks (CRSNs) are composed of sensor nodes equipped with Cognitive Radio (CR) technology with limited resources (e.g., storage, computational speed, bandwidth, security, etc.). In order to overcome resource limitation, cognitive radio sensor nodes are integrated with cloud computing, which provides computing resources (e.g., storage, computation, security, etc.) to sensor nodes. Therefore, the focus of this chapter is integration of cognitive radio sensor networks with cloud computing. In this chapter, the authors first provide background on cloud computing, cognitive radio networks, wireless sensor networks, and cognitive radio sensor networks. This chapter also describes benefits of this integration to both cognitive radio sensor networks and cloud computing, followed by advantages of using cloud computing in cognitive radio sensor networks. Furthermore, it provides applications of cloud-based cognitive radio sensor networks. In the end, the authors provide some issues, challenges, and future directions for such integration.

scholarly journals Energy Efficient Trust Node Based Routing Protocol (EETRP) to Maximize the Lifetime of Wireless Sensor Networks in Plateaus

2019 ◽  
Vol 15 (06) ◽  
pp. 113 ◽  
Author(s):  
Nandoori Srikanth ◽  
Muktyala Sivaganga Prasad
Keyword(s):  
Energy Efficiency ◽  
Wireless Sensor Networks ◽  
Sensor Networks ◽  
Network Lifetime ◽  
Routing Protocol ◽  
Energy Efficient ◽  
Sensor Nodes ◽  
Wireless Sensor ◽  
Mobile Nodes ◽  
Energy Limitation

<p>Wireless Sensor Networks (WSNs) can extant the individual profits and suppleness with regard to low-power and economical quick deployment for numerous applications. WSNs are widely utilized in medical health care, environmental monitoring, emergencies and remote control areas. Introducing of mobile nodes in clusters is a traditional approach, to assemble the data from sensor nodes and forward to the Base station. Energy efficiency and lifetime improvements are key research areas from past few decades. In this research, to solve the energy limitation to upsurge the network lifetime, Energy efficient trust node based routing protocol is proposed. An experimental validation of framework is focused on Packet Delivery Ratio, network lifetime, throughput, energy consumption and network loss among all other challenges. This protocol assigns some high energy nodes as trusted nodes, and it decides the mobility of data collector.  The energy of mobile nodes, and sensor nodes can save up to a great extent by collecting data from trusted nodes based on their trustworthiness and energy efficiency.  The simulation outcome of our evaluation shows an improvement in all these parameters than existing clustering and Routing algorithms.<strong></strong></p>

3D Real-Time Reconstruction Approach for Multimedia Sensor Networks

2010 ◽  
Vol 1 (4) ◽  
pp. 61-77
Author(s):  
Ahmed Mostefaoui ◽  
Benoit Piranda
Keyword(s):  
Sensor Networks ◽  
3D Reconstruction ◽  
Real Time ◽  
Multimedia Data ◽  
Sensor Nodes ◽  
Multimedia Sensor Networks ◽  
Network Bandwidth ◽  
Descriptive Information ◽  
Novel Approach ◽  
Technological Advances

Multimedia sensor networks have emerged due to the tremendous technological advances in multimedia hardware miniaturization and the application potential they present. However, the time sensitive nature of multimedia data makes them very problematic to handle, especially within constrained environments. In this paper, the authors present a novel approach based on continuous 3D real time reconstruction of the monitored area dedicated for video surveillance applications. Real-time 3D reconstruction allows an important network bandwidth reduction in context to sensor nodes sending descriptive information to the fusion server instead heavy video streams. Each node has to support additional processing in order to extract this descriptive information in real-time, which results in video sensors capturing tasks, data analysis, and extraction of features needed for 3D reconstruction. In this paper, the authors focus on the design and implementation of such sensor node and validate their approach through real experimentations conducted on a real video sensor.

A Classifier of Shoulder Movements for a Wearable EMG-Based Device

2017 ◽  
Vol 02 (02) ◽  
pp. 1740003
Author(s):  
Giuseppina Gini ◽  
Lisa Mazzon ◽  
Simone Pontiggia ◽  
Paolo Belluco
Keyword(s):  
Real Time ◽  
Computation Time ◽  
Body Part ◽  
Time Constraints ◽  
Pattern Recognition Method ◽  
Noninvasive Method ◽  
Recognition Method ◽  
Two Phase ◽  
The Real ◽  
User Intentions

Prostheses and exoskeletons need a control system able to rapidly understand user intentions; a noninvasive method is to deploy a myoelectric system, and a pattern recognition method to classify the intended movement to input to the controller. Here we focus on the classification phase. Our first aim is to recognize nine movements of the shoulder, a body part seldom considered in the literature and difficult to treat since the muscles involved are deep. We show that our novel sEMG two-phase classifier, working on a signal window of 500[Formula: see text]ms with 62[Formula: see text]ms increment, has a 97.7% accuracy for nine movements and about 100% accuracy on five movements. After developing the classifier using professionally collected sEMG data from eight channels, our second aim is to implement the classifier on a wearable device, composed by the Intel Edison board and a three-channel experimental portable acquisition board. Our final aim is to develop a complete classifier for dynamic situations, considering the transitions between movements and the real-time constraints. The performance of the classifier, using three channels, is about 96.9%, the classification frequency is 62[Formula: see text]Hz, and the computation time is 16[Formula: see text]ms, far less than the real-time constraint of 300[Formula: see text]ms.

Sign in / Sign up

Export Citation Format

Share Document