• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.193-198
• /
• 2004

In variety of environments for applications, wireless sensor networks have received increasing attention in the recent few years. But, sensor nodes have many limitations including battery power and communication range. These networks require robust wireless communicant protocols that are energy efficient and provide low latency. In this paper, we propose new protocol as is defined SCP. The key idea of SCP is that only one node which is defined as a Super-Cluster Header sends the combined data to the BS. We evaluated the effectiveness of SCP through experiments which have several parameter violations. Simulation results shows that performance of SCP is through better than other legacy protocol within the framework of energy cost, life time of the sensor network and fair distribution of the energy consumption.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.53-61
• /
• 2008

Consider a typical wireless sensor network in which stem nodes form the backbone network of mesh topology while each stem node together with leaf nodes in its vicinity forms a subnetwork of star topology. In such a wireless sensor network, we must heed the following when we design a MAC scheme supporting the packet delivery from a leaf node to a stem node. First, leaf nodes are usually battery-powered and it is difficult to change or recharge their batteries. Secondly, a wireless sensor network is often deployed to collect and update data periodically. Late delivery of a data segment by a sensor node causes the sink node to defer data processing and the data segment itself to be obsolete. Thirdly, extensive signaling is extremely limited and complex computation is hardly supported. Taking account of these facts, a MAC scheme must be able to save energy and support timeliness in packet delivery while being simple and robust as well. In this paper, we propose a version of ALOHA as a MAC scheme for a wireless sensor network. While conserving the simplicity and robustness of the original version of ALOHA, the proposed version of ALOHA possesses a distinctive feature that a sensor node decides between stop and continuation prior to each delivery attempt for a packet. Such a decision needs a stopping rule and we suggest a Bayes stopping rule. Note that a Bayes stopping rule minimizes the Bayes risk which reflects the energy, timeliness and throughput losses. Also, a Bayes stopping rule is practical since a sensor node makes a decision only using its own history of delivery attempt results and the prior information about the failure in delivery attempt. Numerical examples confirm that the proposed version of ALOHA employing a Bayes stopping rule is a useful MAC scheme in the severe environment of wireless sensor network.

• International Journal of Internet, Broadcasting and Communication
• /
• v.12 no.4
• /
• pp.33-41
• /
• 2020

Nowadays, distributed mobility management (DMM) approaches have been widely adopted to address the limitations of centralized architectural methods to support seamless data transmission schemes in wireless sensor networks. This paper deals with the end-to-end (E2E) integration of Network Mobility (NEMO) basic support protocol in distributed wireless sensor network systems in structural health and environmental monitoring of social overhead capital (SOC) public infrastructures such as bridges, national highways, tunnels, and railroads. The proposed scheme takes advantage of the features of both the NEMO basic support protocol and partially distributed network-based DMM framework in providing seamless data transmission and robust mobility support. The E2E seamless data transmission scheme allows mobile users to roam from fixed-point network access locations and mobile platforms (i.e., vehicles such as cars, buses, and trains) without disconnecting its current sessions (i.e., seamless handover).

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.3
• /
• pp.23-30
• /
• 2011

In the wireless sensor network(WSN), the detection of precise location of sensor nodes is essential for efficiently utilizing the sensing data acquired from sensor nodes. Among various location methods, the received signal strength (RSS) based localization scheme is mostly preferable in many applications since it can be easily implemented without any additional hardware cost. Since the RSS localization method is mainly effected by radio channel between two nodes, outlier data can be included in the received signal strength measurement specially when some obstacles move around the link between nodes. The outlier data can have bad effect on estimating the distance between two nodes such that it can cause location errors. In this paper, we propose a RSS-based localization method using Robust Statistic and Gaussian filter algorithm for enhancing the accuracy of RSS-based localization. In the proposed algorithm, the outlier data can be eliminated from samples by using the Robust Statistics as well as the Gaussian filter such that the accuracy of localization can be achieved. Through simulation, it is shown that the proposed algorithm can increase the accuracy of localization and is more robust to non gaussian noise channels.

• Journal of information and communication convergence engineering
• /
• v.6 no.3
• /
• pp.255-260
• /
• 2008

In the recently years, there has been a big interest in ad hoc wireless network as they have tremendous military and commercial potential. An Ad hoc wireless network is composed of mobile computing devices that use having no fixed infrastructure of a multi-hop wireless network formed. So, the fact that limited resource could support the network of robust, simple framework and energy conserving etc. In this paper, we propose a new ad hoc multicast routing protocol for based on the ontology scheme called inference network. Ontology knowledge-based is one of the structure of context-aware. And the ontology clustering adopts a tree structure to enhance resilient against mobility and routing complexity. This proposed multicast routing protocol utilizes node locality to be improve the flexible connectivity and stable mobility on local discovery routing and flooding discovery routing. Also attempts to improve route recovery efficiency and reduce data transmissions of context-awareness. We also provide simulation results to validate the model complexity. We have developed that proposed an algorithm have design multi-hierarchy layered networks to simulate a desired system.

• Journal of Information Processing Systems
• /
• v.8 no.4
• /
• pp.589-602
• /
• 2012

With the increasing demand for real time applications in the Wireless Senor Network (WSN), real time critical events anticipate an efficient quality-of-service (QoS) based routing for data delivery from the network infrastructure. Designing such QoS based routing protocol to meet the reliability and delay guarantee of critical events while preserving the energy efficiency is a challenging task. Considerable research has been focused on developing robust energy efficient QoS based routing protocols. In this paper, we present the state of the research by summarizing the work on QoS based routing protocols that has already been published and by highlighting the QoS issues that are being addressed. The performance comparison of QoS based routing protocols such as SAR, MMSPEED, MCMP, MCBR, and EQSR has also been analyzed using ns-2 for various parameters.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.2 no.4
• /
• pp.242-250
• /
• 2007

Wireless sensor networks are subject to highly heterogeneous system requirements in terms of their functionality and performance due to their broad application areas. Though the heterogeneity hinders the opportunity of developing a single universal platform for sensor networks, efforts to provide uniform, inter-operable and scalable ones for sensor networks are still essential for the growth of the industry as well as their technological advance. As a part of our work to develop such a robust platform, this paper presents the software architecture for sensor nodes with focus on our sensor node operating system and its configuration methodology. Addressing principle issues in its design space which includes programming, execution, task scheduling and software layer models, our architecture is highly reconfigurable with respect to system resources and functional requirements and also highly efficient in supporting multi-threading under small system resources.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.9
• /
• pp.2442-2454
• /
• 2012

To ensure the security of wireless sensor networks, it is important to have a robust key management scheme. In this paper, we propose a Quorum-based key management scheme. A specific sensor, called as key distribution server (KDS), generates a key matrix and establishes a quorum system from the key matrix. The quorum system is a set system of subsets that the intersection of any two subsets is non-empty. In our scheme, each sensor is assigned a subset of the quorum system as its pre-distributed keys. Whenever any two sensors need a shared key, they exchange their IDs, and then each sensor by itself finds a common key from its assigned subset. A shared key is then generated by the two sensors individually based on the common key. By our scheme, no key is needed to be refreshed as a sensor leaves the network. Upon a sensor joining the network, the KDS broadcasts a message containing the joining sensor ID. After receiving the broadcast message, each sensor updates the key which is in common with the new joining one. Only XOR and hash operations are required to be executed during key update process, and each sensor needs to update one key only. Furthermore, if multiple sensors would like to have a secure group communication, the KDS broadcasts a message containing the partial information of a group key, and then each sensor in the group by itself is able to restore the group key by using the secret sharing technique without cooperating with other sensors in the group.

• Journal of Sensor Science and Technology
• /
• v.18 no.5
• /
• pp.337-342
• /
• 2009

This paper describes a robust mobile u-healthcare system with multiple physiological signs measurement capability in real time with integration of WSN(wireless sensor network) technology and CDMA(code division multiple access) network. A cellular phone receives health data in WSN and performs local physiological signs analysis at a phone processor, and then transmits abnormal data to server for further detail or precise health signal evaluation by a medical doctor over a CDMA network. Physiological signs of the patients are continuously monitored, processed and analyzed locally at cellular phone process to produce useful medical information for diagnosis and tracking purposes. By local simple analysis in cellular phone processor we can save the data transmission cost in CDMA network. By using the developed integrate ubiquitous healthcare service architecture, patients can realize self-health checking so that the prevention actions can be taken earlier. Appropriate self-monitoring and self-management can cure disease and relieve pain especially for patients who suffer from chronic diseases that need long term observation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9B
• /
• pp.792-802
• /
• 2006

In this paper, we propose an energy-efficient proactive data dissemination protocol with relatively low delay to cope well with highly mobile sink environments in sensor networks. In order for a dissemination tree to continuously pursue a dynamic sink, we exploit two novel algorithms: forward sink advertisement and distributed fast recovery. In our protocol, the tree is shared with the other slave sinks so that we call it Dynamic Shared Tree (DST) protocol. DST can conserve considerable amount of energy despite maintaining robust connection from all sources to sinks, since tree maintenance of DST is accomplished by just distributed local exchanges. In addition, since the DST is a kindof sink-oriented tree, each source on the DST disseminates data with lower delay along the tree and it also facilitates in-network processing. Through simulations, it is shown that the presented DST is considerably energy-efficient, robust protocol with low delay compared to Directed Diffusion, TTDD, and SEAD, in highly mobile sink environment.