• Title/Summary/Keyword: Sensor nodes

Search Result 2,025, Processing Time 0.035 seconds

An Energy Efficient Cluster-head Selection Algorithm Using Head Experience Information in Wireless Sensor Networks (무선 센서 네트워크환경에서 헤드 경험정보를 이용한 에너지 효율적인 클러스터 헤드 선정 알고리즘)

  • Kim, Hyung-Jue;Kim, Seong-Cheol
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.13 no.3
    • /
    • pp.608-614
    • /
    • 2009
  • In wireless sensor networks, there are hundreds to thousands of small battery powered devices which are called sensors. As sensors have a limited energy resources, there is a need to use it effectively. A clustering based routing protocol forms clusters by distributed algorithm. Member nodes send their data to their cluster heads then cluster heads integrate data and send to sink node. In this paper we propose an energy efficient cluster-head selection algorithm. We have used some factors(a previous cluster head experience, a existence of data to transmit and an information that neighbors have data or not) to select optimum cluster-head and eventually improve network lifetime. Our simulation results show its effectiveness in balancing energy consumption and prolonging the network lifetime compared with LEACH and HEED algorithms.

Improved Routing Algorithm for Enhancing Survivability in Wireless Sensor Networks (무선 센서 네트워크의 생존성 강화를 위한 개선된 라우팅 알고리즘)

  • Choi, Seung-Kwon;Lee, Byong-Rok;Jang, Yoon-Sik;Kim, Tae-Hoon;Ji, Hong-Il
    • The Journal of the Korea Contents Association
    • /
    • v.7 no.9
    • /
    • pp.100-107
    • /
    • 2007
  • This paper proposes and efficient routing scheme named MP-DD(MultiPath-Direct Diffusion) which are simple enough to be applicable to the wireless sensor networks. Conventional DD(Direct Diffusion) uses only one optimal path, therefore it consumes more energy of specific nodes. MP-DD uses multiple path and has a information of hop upstream node in the direction of the base-station. Simulation results show that the proposed scheme can increase network survivability compared to conventional DD and EAR(Energy Aware Routing) schemes.

Data Alignment for Data Fusion in Wireless Multimedia Sensor Networks Based on M2M

  • Cruz, Jose Roberto Perez;Hernandez, Saul E. Pomares;Cote, Enrique Munoz De
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.1
    • /
    • pp.229-240
    • /
    • 2012
  • Advances in MEMS and CMOS technologies have motivated the development of low cost/power sensors and wireless multimedia sensor networks (WMSN). The WMSNs were created to ubiquitously harvest multimedia content. Such networks have allowed researchers and engineers to glimpse at new Machine-to-Machine (M2M) Systems, such as remote monitoring of biosignals for telemedicine networks. These systems require the acquisition of a large number of data streams that are simultaneously generated by multiple distributed devices. This paradigm of data generation and transmission is known as event-streaming. In order to be useful to the application, the collected data requires a preprocessing called data fusion, which entails the temporal alignment task of multimedia data. A practical way to perform this task is in a centralized manner, assuming that the network nodes only function as collector entities. However, by following this scheme, a considerable amount of redundant information is transmitted to the central entity. To decrease such redundancy, data fusion must be performed in a collaborative way. In this paper, we propose a collaborative data alignment approach for event-streaming. Our approach identifies temporal relationships by translating temporal dependencies based on a timeline to causal dependencies of the media involved.

Dynamic Data Distribution for Multi-dimensional Range Queries in Data-Centric Sensor Networks (데이타 기반 센서 네트워크에서 다차원 영역 질의를 위한 동적 데이타 분산)

  • Lim, Yong-Hun;Chung, Yon-Dohn;Kim, Myoung-Ho
    • Journal of KIISE:Databases
    • /
    • v.33 no.1
    • /
    • pp.32-41
    • /
    • 2006
  • In data-centric networks, various data items, such as temperature, humidity, etc. are sensed and stored in sensor nodes. As these attributes are mostly scalar values and inter-related, multi-dimensional range queries are useful. To process multi-dimensional range queries efficiently in data-centric storage, data addressing is essential. The Previous work focused on efficient query processing without considering overall network lifetime. To prolong network lifetime and support multi-dimensional range queries, we propose a dynamic data distribution method for multi-dimensional data, where data space is divided into equal-sized regions and linearized by using Hilbert space filling curve.

Grid Sensor Network Routing Algorithm for Efficient Power Consumption (효율적인 에너지 소비를 위한 그리드 센서 네트워크 라우팅 알고리즘)

  • Kim, Min-Je;Jang, Kyung-Sik
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.10a
    • /
    • pp.1026-1029
    • /
    • 2009
  • Efficient Power consumption is important in sensor networks because charging of deployed sensor nodes is too difficult. So this paper focused on Modified-CBPER reduces energy consumption by reducing CBPER's data announcement ragne, and propose an algorithm to reduce power consumption by additional reduction of data announcement range. Proposed EM-CBPER(Enhanced Modified CBPER) somewhat increases power consumption of data request and data forwarding but it reduces total power consumption by reducing data announcement transmission of account for large quantity on total packet transmission.

  • PDF

A Efficient Energy-Saving Forwarding Technique in Wireless Sensor Networks (무선센서네크워크에서 효율적인 에너지 절약 전송 기법)

  • Duc, Thang Le;Nguyen, Dang Tu;Shon, Min-Han;Choo, Hyun-Seung
    • Annual Conference of KIPS
    • /
    • 2011.04a
    • /
    • pp.158-159
    • /
    • 2011
  • Energy efficiency in wireless sensor networks (WSNs) is one significant factor that needs to be considered when making any designs or doing any enhancements on the communication protocol stack. In WSNs using traditional geographic routing, when a sensor node receives a data packet that needs to be transmitted to the sink, it will forward the packet to the neighbor node which is closest to the sink. The traditional geographic routing assumes that the link quality is always 100%. This may cause a bad result as per which we waste too many energy for retransmissions between the two nodes. Thus, the problem here is how to select such node as forwarder at most efficiently in the aspect of both energy consumption and the distance toward the destination. The better node we choose, the more energy we can conserve for the whole network. In this paper, we propose a next-hop forwarding selection metric, called Energy Consumption for Transmission (ECT), which can resolve the above problem in the best way.

A MAC Protocol Considering Traffic Loads Information For a Clustered Wireless Sensor Networks (클러스터 기반의 무선 센서 네트워크 환경에서 트래픽 부하 정보를 고려한 MAC 프로토콜)

  • Kim, Seong-Cheol;Kim, Hyung-Jue
    • Journal of the Korea Society of Computer and Information
    • /
    • v.14 no.3
    • /
    • pp.113-119
    • /
    • 2009
  • In this paper, we proposed an efficient TDMA scheduling algorithm for a clustered Wireless Sensor Network. Since some previous algorithms used unnecessary idle period and schedule period in each frame. It became an overhead that might consume unexpected energy and delay data transmission. To solve this problem, a dynamic scheduling algorithm according to the number of member nodes and node traffic load within a cluster was suggested. Our proposed DS-MAC(Dynamic Scheduling MAC) could save energy and reduce transmission delay Then DS-MAC was analyzed mathematically to compare with the previous algorithms.

Concealing Communication Source and Destination in Wireless Sensor Networks (Part I) : Protocol Evaluation (무선 센서 네트워크에서의 통신 근원지 및 도착지 은닉(제2부) : 프로토콜 평가)

  • Tscha, Yeong-Hwan
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.3
    • /
    • pp.379-387
    • /
    • 2013
  • In large-scale wireless sensor networks, tremendous amount of dummy packets is usually accompanied by keeping location privacy of the communication source and destination against global eavesdropping. In our earlier work we designed a location privacy routing protocol, ELPR(End-node Location Privacy Routing) in which the generation of dummy packets at each idle time-slot while transferring data packets are restricted to only the nodes within certain areas of encompassing the source and destination, respectively. In this paper, it is given that ELPR provides various degrees of location privacy while PCM(Periodic Collection Method) allows the only fixed level. Simulation results show that as the number of nodes or data packets increases ELPR permits in terms of the number of generated packets more cost-effective location privacy than PCM.

Cluster Head Selection Protocol Using Modified Setup Phase (변형된 셋업 단계를 이용한 클러스터 헤드 선출 프로토콜)

  • Kim, Jin-Su;Choi, Seong-Yong;Han, Seung-Jin;Choi, Jun-Hyeog;Rim, Kee-Wook;Lee, Jung-Hyun
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.1
    • /
    • pp.167-176
    • /
    • 2009
  • Traditional cluster-based routing method is a representative method for increasing the energy efficiencies. In these cluster-based routing methods, the selected cluster head collect/aggregate the information and send the aggregated information to the base station. But they have to solve the unnecessary energy dissipation of frequent information exchange between the cluster head and whole member nodes in cluster. In this paper, we minimize the frequency of the information exchange for reducing the unnecessary transmit/receive frequencies as calculate the overlapped area or number of overlapped member nodes between the selected cluster head and previous cluster head in the setup phase. So, we propose the modified cluster selection protocol method that optimizes the energy dissipation in the setup phase and reuses the saved energy in the steady-state phase efficiently that prolongs the whole wireless sensor network lifetime by uniformly selecting the cluster head.

Position Estimation of a Mobile Robot Based on USN and Encoder and Development of Tele-operation System using Internet (USN과 회전 센서를 이용한 이동로봇의 위치인식과 인터넷을 통한 원격제어 시스템 개발)

  • Park, Jong-Jin
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.9 no.6
    • /
    • pp.55-61
    • /
    • 2009
  • This paper proposes a position estimation of a mobile robot based on USN(Ubiquitous Sensor Network) and encoder, and development of tele-operation system using Internet. USN used in experiments is based on ZigBee protocol and has location estimation engine which uses RSSI signal to estimate distance between nodes. By distortion the estimated distance using RSSI is not correct, compensation method is needed. We obtained fuzzy model to calculate more accurate distance between nodes and use encoder which is built in robot to estimate accurate position of robot. Based on proposed position estimation method, tele-operation system was developed. We show by experiment that proposed method is more appropriate for estimation of position and remote navigation of mobile robot through Internet.

  • PDF