• Journal of Computing Science and Engineering
• /
• 제9권4호
• /
• pp.163-176
• /
• 2015

Self-organization of distributed wireless sensor nodes is a critical issue in wireless sensor networks (WSNs), since each sensor node has limited energy, bandwidth, and scalability. These issues prevent sensor nodes from actively collaborating with the other types of sensor nodes deployed in a typical heterogeneous and somewhat hostile environment. The automated self-organization of a WSN becomes more challenging as the number of sensor nodes increases in the network. In this paper, we propose a dynamic self-organized architecture that combines tree topology with a drawn-grid algorithm to automate the self-organization process for WSNs. In order to make our proposed architecture scalable, we assume that all participating active sensor nodes are unaware of their primary locations. In particular, this paper presents two algorithms called active-tree and drawn-grid. The proposed active-tree algorithm uses a tree topology to assign node IDs and define different roles to each participating sensor node. On the other hand, the drawn-grid algorithm divides the sensor nodes into cells with respect to the radio coverage area and the specific roles assigned by the active-tree algorithm. Thus, both proposed algorithms collaborate with each other to automate the self-organizing process for WSNs. The numerical and simulation results demonstrate that the proposed dynamic architecture performs much better than a static architecture in terms of the self-organization of wireless sensor nodes and energy consumption.

• Journal of Information Processing Systems
• /
• 제16권5호
• /
• pp.1158-1168
• /
• 2020

The distance vector-hop wireless sensor node location method is one of typical range-free location methods. In distance vector-hop location method, if a wireless node A can directly communicate with wireless sensor network nodes B and C at its communication range, the hop count from wireless sensor nodes A to B is considered to be the same as that form wireless sensor nodes A to C. However, the real distance between wireless sensor nodes A and B may be dissimilar to that between wireless sensor nodes A and C. Therefore, there may be a discrepancy between the real distance and the estimated hop count distance, and this will affect wireless sensor node location error of distance vector-hop method. To overcome this problem, it proposes a wireless sensor network node location method by modifying the method of distance estimation in the distance vector-hop method. Firstly, we set three different communication powers for each node. Different hop counts correspond to different communication powers; and so this makes the corresponding relationship between the real distance and hop count more accurate, and also reduces the distance error between the real and estimated distance in wireless sensor network. Secondly, distance difference between the estimated distance between wireless sensor network anchor nodes and their corresponding real distance is computed. The average value of distance errors that is computed in the second step is used to modify the estimated distance from the wireless sensor network anchor node to the unknown sensor node. The improved node location method has smaller node location error than the distance vector-hop algorithm and other improved location methods, which is proved by simulations.

• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제4권7호
• /
• pp.235-238
• /
• 2015

IEEE 802.15.4는 무선 센서노드들 사이의 연결을 가능하게 하는 대표적인 표준이다. 그러나 이 IEEE 802.15.4를 기반으로 하는 무선 센서네트워크는 기본적으로 숨은노드 충돌에 매우 취약하다는 약점을 갖고 있는데 이는 무선 센서네트워크 자체가 제한된 통신 반경과 짧은 배터리 수명을 갖고 있기 때문이다. 본 논문에서는 IEEE 802.15.4 기반의 무선 센서네트워크에서 노드들의 클러스터링을 통한 숨은노드 충돌 회피 및 성능향상 기법을 제안하다. 이 방법에서 사용되는 클러스트링은 각각의 무선 센서노드들이 갖고 있는 채널 품질 정보를 바탕으로 수행된다. 그리고 클러스터에 어느 정도의 무선자원을 할당해야 하는 문제도 다룬다.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2007년도 Proceedings of ISRS 2007
• /
• pp.357-360
• /
• 2007

An asset tracking using wireless sensor network is concerned with geographical locations of sensor nodes. The limited size of sensor nodes makes them attractable for tracking service, at the same time their size causes power restrictions, limited computation power, and storage restrictions. Due to such constrained capabilities, the wireless sensor network basically assumes the failure of sensor nodes. This causes a set of concerns in designing asset tracking system on wireless sensor network and one of the most critical factors is location uncertainty of sensor nodes. In this paper, we classify the location uncertainty problem in asset tracking system into following cases. First, sensor node isn't read at all because of sensor node failure, leading to misunderstanding that asset is not present. Second, incorrect location is read due to interference of RSSI, providing unreliable location of asset. We implemented and installed our asset tracking system in a real environment and continuously monitored the status of asset and measured error rate of location of sensor nodes. We present experimental results that demonstrate the location uncertainty problem in asset tracking system using wireless sensor network.

• 대한임베디드공학회논문지
• /
• 제2권3호
• /
• pp.138-144
• /
• 2007

Wireless Sensor Network(WSN) consists of a lot of light-weight sensor nodes with the capability of wireless communication. Studies have been done to improve stability and fault-tolerancy of WSN because the sensor nodes are basically vulnerable to the harsh environment. Specially, the time synchronization among sensor nodes becomes a challenging issue in WSN. All the local times should always keep the same with each other in the sensor field to perform data aggregation and energy-aware communication in WSN. In this paper, a new time synchronization technique is proposed to operate efficiently irrespective of the number of sensor nodes and the number of hops needed to cover all sensor nodes for synchronization. Simulation results show that the proposed technique has the lowest amount of packet traffic among the several time synchronization techniques.

• Journal of information and communication convergence engineering
• /
• 제6권4호
• /
• pp.459-465
• /
• 2008

Locations of nodes as well as gathered data from nodes are very important because generally multiple nodes are deployed randomly and data are gathered in wireless sensor network. Since the nodes composing wireless sensor network are low cost and low performance devices, it is very difficult to add specially designed devices for positioning into the nodes. Therefore in wireless sensor network, technology positioning nodes precisely using low cost is very important and valuable. This research proposes Cooperative Positioning System, which raises accuracy of location positioning and also can find positions on multiple sensors within limited times.

• International Journal of Internet, Broadcasting and Communication
• /
• 제9권4호
• /
• pp.38-43
• /
• 2017

Sensor Networks (WSNs) can be defined as a self-configured and infrastructure-less wireless networks to monitor physical or environmental conditions, such as temperature, sound, vibration, pressure, motion or pollutants and to cooperatively pass their data through the network to a main location or base-station where the data can be observed and analyzed. Typically a wireless sensor network contains hundreds of thousands of sensor nodes. The sensor nodes can communicate among themselves using radio signals. A wireless sensor node is equipped with sensing and computing devices, radio transceivers and power components. The individual nodes in a wireless sensor network (WSN) are inherently resource constrained: they have limited processing speed, storage capacity, communication bandwidth and limited-battery power. At present time, most of the research on WSNs has concentrated on the design of energy- and computationally efficient algorithms and protocols In order to extend the network life-time, in this paper we are looking into a routing protocol, especially LEACH and LEACH-related protocol. LEACH protocol is a representative routing protocol and improves overall network energy efficiency by allowing all nodes to be selected to the cluster head evenly once in a periodic manner. In LEACH, in case of movement of sensor nodes, there is a problem that the data transmission success rate decreases. In order to overcome LEACH's nodes movements, LEACH-Mobile protocol had proposed. But energy consumption increased because it consumes more energy to recognize which nodes moves and re-transfer data. In this paper we propose the new routing protocol considering nodes' mobility. In order to simulate the proposed protocol, we make a scenario, nodes' movements randomly and compared with the LEACH-Mobile protocol.

• Journal of Information Processing Systems
• /
• 제6권3호
• /
• pp.295-306
• /
• 2010

Network lifetime is a critical issue in Wireless Sensor Networks (WSNs). In which, a large number of sensor nodes communicate together to perform a predetermined sensing task. In such networks, the network life time depends mainly on the lifetime of the sensor nodes constituting the network. Therefore, it is essential to balance the energy consumption among all sensor nodes to ensure the network connectivity. In this paper, we propose an energy-efficient data routing protocol for wireless sensor networks. Contrary to the protocol proposed in [6], that always selects the path with minimum hop count to the base station, our proposed routing protocol may choose a longer path that will provide better distribution of the energy consumption among the sensor nodes. Simulation results indicate clearly that compared to the routing protocol proposed in [6], our proposed protocol evenly distributes the energy consumption among the network nodes thus maximizing the network life time.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권5호
• /
• pp.998-1013
• /
• 2013

Wireless wearable sensor networks have emerged as a promising technique for human motion tracking due to the flexibility and scalability. In such system several wireless sensor nodes being attached to human limb construct a wearable sensor network, where each sensor node including MEMS sensors (such as 3-axis accelerometer, 3-axis magnetometer and 3-axis gyroscope) monitors the limb orientation and transmits these information to the base station for reconstruction via low-power wireless communication technique. Due to the energy constraint, the high fidelity requirement for real time rendering of human motion and tiny operating system embedded in each sensor node adds more challenges for the system implementation. In this paper, we discuss such challenges and experiences in detail during the implementation of such system with wireless wearable sensor network which includes COTS wireless sensor nodes (Imote 2) and uses TinyOS 1.x in each sensor node. Since our system uses the COTS sensor nodes and popular tiny operating system, it might be helpful for further exploration in such field.

• ETRI Journal
• /
• 제42권1호
• /
• pp.36-45
• /
• 2020

A priority-based data communication approach, developed by employing cognitive radio capacity for sensor nodes in a wireless terrestrial sensor network (TSN), has been proposed. Data sensed by a sensor node-an unlicensed user-were prioritized, taking sensed data importance into account. For data of equal priority, a first come first serve algorithm was used. Non-preemptive priority scheduling was adopted, in order not to interrupt any ongoing transmissions. Licensed users used a nonpersistent, slotted, carrier sense multiple access (CSMA) technique, while unlicensed sensor nodes used a nonpersistent CSMA technique for lossless data transmission, in an energy-restricted, TSN environment. Depending on the analytical model, the proposed wireless TSN environment was simulated using Riverbed software, and to analyze sensor network performance, delay, energy, and throughput parameters were examined. Evaluating the proposed approach showed that the average delay for sensed, high priority data was significantly reduced, indicating that maximum throughput had been achieved using wireless sensor nodes with cognitive radio capacity.