• Title/Summary/Keyword: energy-aware

Search Result 364, Processing Time 0.035 seconds

An Inter-Session Opportunistic Network Coding-aware Multipath Routing Protocol (세션간 네트워크 코딩 기회를 인식하는 다중 경로 라우팅 프로토콜)

  • Choi, Tae-Jong;Kang, Kyung-Ran;Cho, Young-Jong;Bang, June-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.7B
    • /
    • pp.536-549
    • /
    • 2012
  • An ad hoc network consists of nodes with limited energy. Therefore, the data transmission can fail abruptly due to lack of energy of transmitting node. A previous work PAMP proposed to build multiple low-energy paths to support stable packet delivery exploiting the nodes with low energy. It has energy-reservation scheme and multi-path selection scheme for stationary wireless ad hoc networks. In this paper, we propose an extended version of PAMP by incorporating network coding opportunity in path selection process. The simulation results show that our proposed scheme shows better packet delivery ratio and lower energy consumption compared with PAMP and a legacy energy-aware multipath routing protocol REAR.

Hierarchical Energy-Aware Routing Algorithm for Heterogeneous Wireless Sensor Networks (Heterogeneous 무선 센서 네트워크를 위한 계층적 에너지 인지 라우팅 알고리즘)

  • Park, Jin-Ho;Seo, Sang-Bo;Song, Seung-Mi;Kim, Sung-Un
    • Proceedings of the IEEK Conference
    • /
    • 2007.07a
    • /
    • pp.13-14
    • /
    • 2007
  • We propose HERAH(Hierarchical Energy-Aware Routing Algorithm for Heterogeneous Wireless Sensor Networks) that is the hierarchical routing algorithm in WSNs and is established on heterogeneous environment. HERAH performs CH selection by considering residual energy level and uses multi-hop communication within cluster. So, HERAH makes improvements in the energy savings and the network lifetime compared with LEACH.

  • PDF

Energy Aware Routing Protocol over Wireless Sensor Network (센서 네트워크에서 에너지 보유량을 고려한 라우팅 프로토콜)

  • Choi, Hae-Won;Yoo, Kee-Young
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.13 no.2
    • /
    • pp.28-34
    • /
    • 2008
  • This paper reports the problem in the previous routing protocol, EAR, and proposes an energy aware routing protocol to solve the problem in it. Proposed routing protocol considers the number of hops, the possibility of node exhaustion, and the node energy amount at the same time from the source to the sink. Thereby, it could efficiently solve the potential network separation problem and the sensing hole problem in EAR. Proposed routing protocol could remove the problems in the previous routing protocols but it still gets the advantages in them.

  • PDF

Energy Aware Landmark Election and Routing Protocol for Grid-based Wireless Sensor Network (그리드 기반 무선센서네트워크에서 에너지 인지형 Landmark 선정 및 라우팅 프로토콜)

  • Sanwar Hosen, A.S.M.;Cho, Gi-Hwan
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.11a
    • /
    • pp.177-180
    • /
    • 2011
  • In practice, it is well known that geographical and/or location based routing is highly effective for wireless sensor network. Here, electing some landmarks on the network and forwarding data based on the landmark is one of the good approaches for a vast sensing field with holes. In the most previous works, landmarks are elected without considering the residual energy on each sensor. In this paper, we propose an Energy aware Landmark Election and Routing (ELER) protocol to establish a stable routing paths and reduce the total power consumption. The proposed protocol makes use of each sensor's energy level on electing the landmarks, which would be utilized to route a packet towards the target region using greedy forwarding method. Our simulation results illustrate that the proposed scheme can significantly reduce the power dissipation and effectively lengthen the lifetime of the network.

Energy-Aware Self-Stabilizing Distributed Clustering Protocol for Ad Hoc Networks: the case of WSNs

  • Ba, Mandicou;Flauzac, Olivier;Haggar, Bachar Salim;Makhloufi, Rafik;Nolot, Florent;Niang, Ibrahima
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.11
    • /
    • pp.2577-2596
    • /
    • 2013
  • In this paper, we present an Energy-Aware Self-Stabilizing Distributed Clustering protocol based on message-passing model for Ad Hoc networks. The latter does not require any initialization. Starting from an arbitrary configuration, the network converges to a stable state in a finite time. Our contribution is twofold. We firstly give the formal proof that the stabilization is reached after at most n+2 transitions and requires at most $n{\times}log(2n+{\kappa}+3)$ memory space, where n is the number of network nodes and ${\kappa}$ represents the maximum hops number in the clusters. Furthermore, using the OMNeT++ simulator, we perform an evaluation of our approach. Secondly, we propose an adaptation of our solution in the context of Wireless Sensor Networks (WSNs) with energy constraint. We notably show that our protocol can be easily used for constructing clusters according to multiple criteria in the election of cluster-heads, such as nodes' identity, residual energy or degree. We give a comparison under the different election metrics by evaluating their communication cost and energy consumption. Simulation results show that in terms of number of exchanged messages and energy consumption, it is better to use the Highest-ID metric for electing CHs.

Context-aware Video Surveillance System

  • An, Tae-Ki;Kim, Moon-Hyun
    • Journal of Electrical Engineering and Technology
    • /
    • v.7 no.1
    • /
    • pp.115-123
    • /
    • 2012
  • A video analysis system used to detect events in video streams generally has several processes, including object detection, object trajectories analysis, and recognition of the trajectories by comparison with an a priori trained model. However, these processes do not work well in a complex environment that has many occlusions, mirror effects, and/or shadow effects. We propose a new approach to a context-aware video surveillance system to detect predefined contexts in video streams. The proposed system consists of two modules: a feature extractor and a context recognizer. The feature extractor calculates the moving energy that represents the amount of moving objects in a video stream and the stationary energy that represents the amount of still objects in a video stream. We represent situations and events as motion changes and stationary energy in video streams. The context recognizer determines whether predefined contexts are included in video streams using the extracted moving and stationary energies from a feature extractor. To train each context model and recognize predefined contexts in video streams, we propose and use a new ensemble classifier based on the AdaBoost algorithm, DAdaBoost, which is one of the most famous ensemble classifier algorithms. Our proposed approach is expected to be a robust method in more complex environments that have a mirror effect and/or a shadow effect.

Scate: A Scalable Time and Energy Aware Actor Task Allocation Algorithm in Wireless Sensor and Actor Networks

  • Sharifi, Mohsen;Okhovvat, Morteza
    • ETRI Journal
    • /
    • v.34 no.3
    • /
    • pp.330-340
    • /
    • 2012
  • In many applications of wireless sensor actor networks (WSANs) that often run in harsh environments, the reduction of completion times of tasks is highly desired. We present a new time-aware, energy-aware, and starvation-free algorithm called Scate for assigning tasks to actors while satisfying the scalability and distribution requirements of WSANs with semi-automated architecture. The proposed algorithm allows concurrent executions of any mix of small and large tasks and yet prevents probable starvation of tasks. To achieve this, it estimates the completion times of tasks on each available actor and then takes the remaining energies and the current workloads of these actors into account during task assignment to actors. The results of our experiments with a prototyped implementation of Scate show longer network lifetime, shorter makespan of resulting schedules, and more balanced loads on actors compared to when one of the three well-known task-scheduling algorithms, namely, the max-min, min-min, and opportunistic load balancing algorithms, is used.

Clustering Algorithm Considering Sensor Node Distribution in Wireless Sensor Networks

  • Yu, Boseon;Choi, Wonik;Lee, Taikjin;Kim, Hyunduk
    • Journal of Information Processing Systems
    • /
    • v.14 no.4
    • /
    • pp.926-940
    • /
    • 2018
  • In clustering-based approaches, cluster heads closer to the sink are usually burdened with much more relay traffic and thus, tend to die early. To address this problem, distance-aware clustering approaches, such as energy-efficient unequal clustering (EEUC), that adjust the cluster size according to the distance between the sink and each cluster head have been proposed. However, the network lifetime of such approaches is highly dependent on the distribution of the sensor nodes, because, in randomly distributed sensor networks, the approaches do not guarantee that the cluster energy consumption will be proportional to the cluster size. To address this problem, we propose a novel approach called CACD (Clustering Algorithm Considering node Distribution), which is not only distance-aware but also node density-aware approach. In CACD, clusters are allowed to have limited member nodes, which are determined by the distance between the sink and the cluster head. Simulation results show that CACD is 20%-50% more energy-efficient than previous work under various operational conditions considering the network lifetime.

Trust-aware secure routing protocol for wireless sensor networks

  • Hu, Huangshui;Han, Youjia;Wang, Hongzhi;Yao, Meiqin;Wang, Chuhang
    • ETRI Journal
    • /
    • v.43 no.4
    • /
    • pp.674-683
    • /
    • 2021
  • A trust-aware secure routing protocol (TSRP) for wireless sensor networks is proposed in this paper to defend against varieties of attacks. First, each node calculates the comprehensive trust values of its neighbors based on direct trust value, indirect trust value, volatilization factor, and residual energy to defend against black hole, selective forwarding, wormhole, hello flood, and sinkhole attacks. Second, any source node that needs to send data forwards a routing request packet to its neighbors in multi-path mode, and this continues until the sink at the end is reached. Finally, the sink finds the optimal path based on the path's comprehensive trust values, transmission distance, and hop count by analyzing the received packets. Simulation results show that TSRP has lower network latency, smaller packet loss rate, and lower average network energy consumption than ad hoc on-demand distance vector routing and trust based secure routing protocol.

An IoT-Aware System for Managing Patients' Waiting Time Using Bluetooth Low-Energy Technology

  • Reham Alabduljabbar
    • International Journal of Computer Science & Network Security
    • /
    • v.24 no.3
    • /
    • pp.83-92
    • /
    • 2024
  • It is a common observation that whenever any patient arrives at the front desk of a hospital, outpatient clinic, or other health-associated centers, they have to first queue up in a line and wait to fill in their registration form to get admitted. The long waiting time without any status updates is the most common complaint, worrying health officials. In this paper, UrNext, a location-aware mobile-based solution using Bluetooth low-energy (BLE) technology, is presented to solve the problem. Recently, a technology-oriented method has been gaining popularity in solving the healthcare sector's problems, namely the Internet of Things (IoT). The implementation of this solution could be explained through a simple example that when a patient arrives at a clinic for her consultation. There, instead of having to wait in long lines, she will be greeted automatically, receive a push notification telling her that she has been admitted along with an estimated waiting time for her consultation session. This will not only provide the patients with a sense of freedom but would also reduce uncertainty levels that are generally observed, thus saving both time and money. This work aimed to improve clinics' quality of services and organize queues and minimize waiting times in clinics, leading to patient comfortability and reducing the burden on nurses and receptionists. The results demonstrated that the presented system was successful in its performance and helped achieve high usability.