• 제목/요약/키워드: Wireless Sensor Networks

검색결과 1,840건 처리시간 0.033초

무선 센서 네트워크망에서의 효율적인 키 관리 프로토콜 분석 (Analyses of Key Management Protocol for Wireless Sensor Networks in Wireless Sensor Networks)

  • 김정태
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2005년도 추계종합학술대회
    • /
    • pp.799-802
    • /
    • 2005
  • In this paper, we analyses of Key Management Protocol for Wireless Sensor Networks in Wireless Sensor Networks. Wireless sensor networks have a wide spectrum of civil military application that call for security, target surveillance in hostile environments. Typical sensors possess limited computation, energy, and memory resources; therefore the use of vastly resource consuming security mechanism is not possible. In this paper, we propose a cryptography key management protocol, which is based on identity based symmetric keying.

  • PDF

Communication Pattern Based Key Establishment Scheme in Heterogeneous Wireless Sensor Networks

  • Kim, Daehee;Kim, Dongwan;An, Sunshin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제10권3호
    • /
    • pp.1249-1272
    • /
    • 2016
  • In this paper, we propose a symmetric key establishment scheme for wireless sensor networks which tries to minimize the resource usage while satisfying the security requirements. This is accomplished by taking advantage of the communication pattern of wireless sensor networks and adopting heterogeneous wireless sensor networks. By considering the unique communication pattern of wireless sensor networks due to the nature of information gathering from the physical world, the number of keys to be established is minimized and, consequently, the overhead spent for establishing keys decreases. With heterogeneous wireless sensor networks, we can build a hybrid scheme where a small number of powerful nodes do more works than a large number of resource-constrained nodes to provide enhanced security service such as broadcast authentication and reduce the burden of resource-limited nodes. In addition, an on-demand key establishment scheme is introduced to support extra communications and optimize the resource usage. Our performance analysis shows that the proposed scheme is very efficient and highly scalable in terms of storage, communication and computation overhead. Furthermore, our proposed scheme not only satisfies the security requirements but also provides resilience to several attacks.

A Clustering Protocol with Mode Selection for Wireless Sensor Network

  • Kusdaryono, Aries;Lee, Kyung-Oh
    • Journal of Information Processing Systems
    • /
    • 제7권1호
    • /
    • pp.29-42
    • /
    • 2011
  • Wireless sensor networks are composed of a large number of sensor nodes with limited energy resources. One critical issue in wireless sensor networks is how to gather sensed information in an energy efficient way, since their energy is limited. The clustering algorithm is a technique used to reduce energy consumption. It can improve the scalability and lifetime of wireless sensor networks. In this paper, we introduce a clustering protocol with mode selection (CPMS) for wireless sensor networks. Our scheme improves the performance of BCDCP (Base Station Controlled Dynamic Clustering Protocol) and BIDRP (Base Station Initiated Dynamic Routing Protocol) routing protocol. In CPMS, the base station constructs clusters and makes the head node with the highest residual energy send data to the base station. Furthermore, we can save the energy of head nodes by using the modes selection method. The simulation results show that CPMS achieves longer lifetime and more data message transmissions than current important clustering protocols in wireless sensor networks.

Evaluating an (m, k)-firm Deadline Real-time Stream Based on a Reliable Transport Protocol in Wireless Sensor Networks

  • Kim, Ki-Il
    • Journal of information and communication convergence engineering
    • /
    • 제10권2호
    • /
    • pp.129-134
    • /
    • 2012
  • As application-specific requirements for wireless sensor networks emerge, both real-time and reliable communications become major research challenges in wireless sensor networks due to the many constraints on nodes and wireless links. To support these services, several protocols have been proposed. However, since most of them were designed as well as developed for general purpose applications, it is not recommended that they be directly adapted to applications with special requirements. In this paper, we propose a way to extend the current reliable transport protocol to cover a special real-time service, the (m,k)-firm deadline stream, in wireless sensor networks. While the proposed scheme is basically built on the PSFQ protocol for reliability, some features have been newly developed to support the (m,k)-firm stream efficiently. Finally, simulation results are given to demonstrate the feasibility of the proposed scheme in high traffic and with failed links.

Reliable Gossip Zone for Real-Time Communications in Wireless Sensor Networks

  • Li, Bijun;Kim, Ki-Il
    • Journal of information and communication convergence engineering
    • /
    • 제9권2호
    • /
    • pp.244-250
    • /
    • 2011
  • Gossip is a well-known protocol which was proposed to implement broadcast service with a high reliability in an arbitrarily connected network of sensor nodes. The probabilistic techniques employed in gossip have been used to address many challenges which are caused by flooding in wireless sensor networks (WSNs). However, very little work has yet been done on real-time wireless sensor networks which require not only highly reliable packets reception but also strict time constraint of each packet. Moreover, the unique energy constraining feature of sensor makes existing solutions unsuitable. Combined with unreliable links, redundant messages overhead in real-time wireless sensor networks is a new challenging issue. In this paper, we introduce a Reliable Gossip Zone, a novel fine-tailored mechanism for real-time wireless sensor networks with unreliable wireless links and low packet redundancy. The key idea is the proposed forwarding probability algorithm, which makes forwarding decisions after the realtime flooding zone is set. Evaluation shows that as an oracle broadcast service design, our mechanism achieves significantly less message overhead than traditional flooding and gossip protocols.

A Hybrid Adaptive Security Framework for IEEE 802.15.4-based Wireless Sensor Networks

  • Shon, Tae-Shik;Park, Yong-Suk
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제3권6호
    • /
    • pp.597-611
    • /
    • 2009
  • With the advent of ubiquitous computing society, many advanced technologies have enabled wireless sensor networks which consist of small sensor nodes. However, the sensor nodes have limited computing resources such as small size memory, low battery life, short transmission range, and low computational capabilities. Thus, decreasing energy consumption is one of the most significant issues in wireless sensor networks. In addition, numerous applications for wireless sensor networks are recently spreading to various fields (health-care, surveillance, location tracking, unmanned monitoring, nuclear reactor control, crop harvesting control, u-city, building automation etc.). For many of them, supporting security functionalities is an indispensable feature. Especially in case wireless sensor networks should provide a sufficient variety of security functions, sensor nodes are required to have more powerful performance and more energy demanding features. In other words, simultaneously providing security features and saving energy faces a trade-off problem. This paper presents a novel energy-efficient security architecture in an IEEE 802.15.4-based wireless sensor network called the Hybrid Adaptive Security (HAS) framework in order to resolve the trade off issue between security and energy. Moreover, we present a performance analysis based on the experimental results and a real implementation model in order to verify the proposed approach.

Analysis of Channel Access Delay in CR-MAC Protocol for Ad Hoc Cognitive Radio Wireless Sensor Networks without a Common Control Channel

  • Joshi, Gyanendra Prasad;Nam, Seung Yeob;Acharya, Srijana;Kim, Sung Won
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권3호
    • /
    • pp.911-923
    • /
    • 2014
  • Ad hoc cognitive radio wireless sensor networks allow secondary wireless sensor nodes to recognize spectrum opportunities and transmit data. Most existing protocols proposed for ad hoc cognitive radio wireless sensor networks require a dedicated common control channel. Allocating one channel just for control packet exchange is a waste of resources for channel-constrained networks. There are very few protocols that do not rely on a common control channel and that exchange channel-negotiation control packets during a pre-allocated time on the data channels. This, however, can require a substantial amount of time to access the channel when an incumbent is present on the channel, where the nodes are intended to negotiate for the data channel. This study examined channel access delay on cognitive radio wireless sensor networks that have no dedicated common control channel.

An Identity-based Ring Signcryption Scheme: Evaluation for Wireless Sensor Networks

  • Sharma, Gaurav;Bala, Suman;Verma, Anil K.
    • IEIE Transactions on Smart Processing and Computing
    • /
    • 제2권2호
    • /
    • pp.57-66
    • /
    • 2013
  • Wireless Sensor Networks consist of small, inexpensive, low-powered sensor nodes that communicate with each other. To achieve a low communication cost in a resource constrained network, a novel concept of signcryption has been applied for secure communication. Signcryption enables a user to perform a digital signature for providing authenticity and public key encryption for providing message confidentiality simultaneously in a single logical step with a lower cost than that of the sign-then-encrypt approach. Ring signcryption maintains the signer's privacy, which is lacking in normal signcryption schemes. Signcryption can provide confidentiality and authenticity without revealing the user's identity of the ring. This paper presents the security notions and an evaluation of an ID-based ring signcryption scheme for wireless sensor networks. The scheme has been proven to be better than the existing schemes. The proposed scheme was found to be secure against adaptive chosen ciphertext ring attacks (IND-IDRSC-CCA2) and secure against an existential forgery for adaptive chosen message attacks (EF-IDRSC-ACMA). The proposed scheme was found to be more efficient than scheme for Wireless Sensor Networks reported by Qi. et al. based on the running time and energy consumption.

  • PDF

Wireless sensor networks for long-term structural health monitoring

  • Meyer, Jonas;Bischoff, Reinhard;Feltrin, Glauco;Motavalli, Masoud
    • Smart Structures and Systems
    • /
    • 제6권3호
    • /
    • pp.263-275
    • /
    • 2010
  • In the last decade, wireless sensor networks have emerged as a promising technology that could accelerate progress in the field of structural monitoring. The main advantages of wireless sensor networks compared to conventional monitoring technologies are fast deployment, small interference with the surroundings, self-organization, flexibility and scalability. These features could enable mass application of monitoring systems, even on smaller structures. However, since wireless sensor network nodes are battery powered and data communication is the most energy consuming task, transferring all the acquired raw data through the network would dramatically limit system lifetime. Hence, data reduction has to be achieved at the node level in order to meet the system lifetime requirements of real life applications. The objective of this paper is to discuss some general aspects of data processing and management in monitoring systems based on wireless sensor networks, to present a prototype monitoring system for civil engineering structures, and to illustrate long-term field test results.

An Optimal Schedule Algorithm Trade-Off Among Lifetime, Sink Aggregated Information and Sample Cycle for Wireless Sensor Networks

  • Zhang, Jinhuan;Long, Jun;Liu, Anfeng;Zhao, Guihu
    • Journal of Communications and Networks
    • /
    • 제18권2호
    • /
    • pp.227-237
    • /
    • 2016
  • Data collection is a key function for wireless sensor networks. There has been numerous data collection scheduling algorithms, but they fail to consider the deep and complex relationship among network lifetime, sink aggregated information and sample cycle for wireless sensor networks. This paper gives the upper bound on the sample period under the given network topology. An optimal schedule algorithm focusing on aggregated information named OSFAI is proposed. In the schedule algorithm, the nodes in hotspots would hold on transmission and accumulate their data before sending them to sink at once. This could realize the dual goals of improving the network lifetime and increasing the amount of information aggregated to sink. We formulate the optimization problem as to achieve trade-off among sample cycle, sink aggregated information and network lifetime by controlling the sample cycle. The results of simulation on the random generated wireless sensor networks show that when choosing the optimized sample cycle, the sink aggregated information quantity can be increased by 30.5%, and the network lifetime can be increased by 27.78%.