• Title/Summary/Keyword: wireless ad hoc networks

Search Result 605, Processing Time 0.029 seconds

IDMMAC: Interference Aware Distributed Multi-Channel MAC Protocol for WSAN

  • Kakarla, Jagadeesh;Majhi, Banshidhar;Battula, Ramesh Babu
    • Journal of Information Processing Systems
    • /
    • v.13 no.5
    • /
    • pp.1229-1242
    • /
    • 2017
  • In this paper, an interference aware distributed multi-channel MAC (IDMMAC) protocol is proposed for wireless sensor and actor networks (WSANs). The WSAN consists of a huge number of sensors and ample amount of actors. Hence, in the IDMMAC protocol a lightweight channel selection mechanism is proposed to enhance the sensor's lifetime. The IDMMAC protocol divides the beacon interval into two phases (i.e., the ad-hoc traffic indication message (ATIM) window phase and data transmission phase). When a sensor wants to transmit event information to the actor, it negotiates the maximum packet reception ratio (PRR) and the capacity channel in the ATIM window with its 1-hop sensors. The channel negotiation takes place via a control channel. To improve the packet delivery ratio of the IDMMAC protocol, each actor selects a backup cluster head (BCH) from its cluster members. The BCH is elected based on its residual energy and node degree. The BCH selection phase takes place whenever an actor wants to perform actions in the event area or it leaves the cluster to help a neighbor actor. Furthermore, an interference and throughput aware multi-channel MAC protocol is also proposed for actor-actor coordination. An actor selects a minimum interference and maximum throughput channel among the available channels to communicate with the destination actor. The performance of the proposed IDMMAC protocol is analyzed using standard network parameters, such as packet delivery ratio, end-to-end delay, and energy dissipation, in the network. The obtained simulation results indicate that the IDMMAC protocol performs well compared to the existing MAC protocols.

A Key Management Scheme for Ad hoc Sensor Networks (애드 혹 센서 네트워크를 위한 키 관리 방안)

  • Kim Seung-Hae;Chung Byung-Ho;Wang Gi-Cheol;Cho Gi-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.7 s.349
    • /
    • pp.32-40
    • /
    • 2006
  • It is very important to establish a pairwise key securely in wireless sensor networks. Because sensor networks consist of devices with weak physical security, they are likely to be compromised by an attacker. However, some approaches using key pre-distribution and other approaches using one hop local keys are known to be very vulnerable to threats caused by compromised nodes, even a small number. This paper proposes a scheme where each node establishes three hop local keys and employs them for a later pairwise key establishment. When any two nodes agree a pairwise key, all nodes on the route between two nodes contribute to the agreement of the pairwise key. Here, the initial three hop local keys are employed for encrypting a secret key delivered from a node to other nodes. Therefore, the proposed scheme bothers attackers to compromise much more nodes than the scheme using one hop local keys only. The simulation results have proven that the proposed scheme provides better performance and higher security than the scheme using one hop local keys in terms of message exchange, the number of encryption and decryption, and pairwise key exposure rate.

TeloSIM: Instruction-level Sensor Network Simulator for Telos Sensor Node (TeloSIM: Telos 형 센서노드를 위한 명령어 수준 센서네트워크 시뮬레이터)

  • Joe, Hyun-Woo;Kim, Hyung-Shin
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.11
    • /
    • pp.1021-1030
    • /
    • 2010
  • In the sensor network, many tiny nodes construct Ad-Hoc network using wireless interface. As this type of system consists of thousands of nodes, managing each sensor node in real world after deploying them is very difficult. In order to install the sensor network successfully, it is necessary to verify its software using a simulator beforehand. In fact Sensor network simulators require high fidelity and timing accuracy to be used as a design, implementation, and evaluation tool of wireless sensor networks. Cycle-accurate, instruction-level simulation is the known solution for those purposes. In this paper, we developed an instruction-level sensor network simulator for Telos sensor node as named TeloSlM. It consists of MSP430 and CC2420. Recently, Telos is the most popular mote because MSP430 can consume the minimum energy in recent motes and CC2420 can support Zigbee. So that TeloSlM can provide the easy way for the developers to verify software. It is cycle-accurate in instruction-level simulator that is indispensable for OS and the specific functions and can simulate scalable sensor network at the same time. In addition, TeloSlM provides the GUI Tool to show result easily.

Reliable multi-hop communication for structural health monitoring

  • Nagayama, Tomonori;Moinzadeh, Parya;Mechitov, Kirill;Ushita, Mitsushi;Makihata, Noritoshi;Ieiri, Masataka;Agha, Gul;Spencer, Billie F. Jr.;Fujino, Yozo;Seo, Ju-Won
    • Smart Structures and Systems
    • /
    • v.6 no.5_6
    • /
    • pp.481-504
    • /
    • 2010
  • Wireless smart sensor networks (WSSNs) have been proposed by a number of researchers to evaluate the current condition of civil infrastructure, offering improved understanding of dynamic response through dense instrumentation. As focus moves from laboratory testing to full-scale implementation, the need for multi-hop communication to address issues associated with the large size of civil infrastructure and their limited radio power has become apparent. Multi-hop communication protocols allow sensors to cooperate to reliably deliver data between nodes outside of direct communication range. However, application specific requirements, such as high sampling rates, vast amounts of data to be collected, precise internodal synchronization, and reliable communication, are quite challenging to achieve with generic multi-hop communication protocols. This paper proposes two complementary reliable multi-hop communication solutions for monitoring of civil infrastructure. In the first approach, termed herein General Purpose Multi-hop (GPMH), the wide variety of communication patterns involved in structural health monitoring, particularly in decentralized implementations, are acknowledged to develop a flexible and adaptable any-to-any communication protocol. In the second approach, termed herein Single-Sink Multi-hop (SSMH), an efficient many-to-one protocol utilizing all available RF channels is designed to minimize the time required to collect the large amounts of data generated by dense arrays of sensor nodes. Both protocols adopt the Ad-hoc On-demand Distance Vector (AODV) routing protocol, which provides any-to-any routing and multi-cast capability, and supports a broad range of communication patterns. The proposed implementations refine the routing metric by considering the stability of links, exclude functionality unnecessary in mostly-static WSSNs, and integrate a reliable communication layer with the AODV protocol. These customizations have resulted in robust realizations of multi-hop reliable communication that meet the demands of structural health monitoring.

A RSU-Aided Resource Search and Cloud Construction Mechanism in VANETs (차량 네트워크에서 RSU를 이용한 리소스 검색 및 클라우드 구축 방안)

  • Lee, Yoonhyeong;Lee, Euisin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.9 no.3
    • /
    • pp.67-76
    • /
    • 2020
  • With the fast development in wireless communications and vehicular technologies, vehicular ad hoc networks (VANETs) have enabled to deliver data between vehicles. Recently, VANETs introduce a Vehicular Cloud (VC) model for collaborating to share and use resources of vehicles to create value-added services. To construct a VC, a vehicle should search vehicles that intend to provide their own resource. The single-hop search cannot search enough provider vehicles due to a small coverage and non-line-of-sights of communications. On the other hand, the multi-hop search causes very high traffics for large coverage searching and frequent connection breakages. Recently, many Roadside Units (RSUs) have been deployed on roads to collect the information of vehicles in their own coverages and to connect them to Internet. Thus, we propose a RSU-aided vehicular resource search and cloud construction mechanism in VANETS. In the proposed mechanism, a RSU collects the information of location and mobility of vehicles and selects provider vehicles enabled to provide resources needed for constructing a VC of a requester vehicle based on the collected information. In the proposed mechanism, the criteria for determining provider vehicles to provide resources are the connection duration between each candidate vehicle and the requester vehicle, the resource size of each candidate vehicle, and its connection starting time to the requester vehicle. Simulation results verify that the proposed mechanism achieves better performance than the existing mechanism.