COSEN: A Chain Oriented Sensor Network for Efficient Data Collection

Tabassum, Nahdia; Ehsanul, Q.; Mamun, K. A.; Urano, Yoshiyori

doi:10.1109/itng.2006.44

Cited by 65 publications

(25 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…H-PEGASIS [10], the concentric clustering scheme for PE-GASIS [15] and COSEN [16]. As expected these do better than PEGASIS in terms of delay since their hierarchical nature helps in simultaneous multiple chain buildings and hence reduced delays.…”

Section: A Related Workmentioning

confidence: 91%

A computationally inexpensive and power efficient fully distributed topology for data collection in heterogeneous wireless sensor networks

Bagchi

Madan

Premi

2011

2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS)

View full text Add to dashboard Cite

We introduce hierarchical neighbor graphs, a new topology control mechanism for wireless sensor networks. This mechanism is a randomized one that takes a single parameter, 0 < p < 1, and uses it to build a structure that is fully distributed in the sense that it requires only local knowledge at each node to be formed and repaired, and moreover requires minimal computation in this process. Hierarchical neighbor graphs naturally account for differences in the battery power of nodes and are able to use energy efficiently by reorganizing dynamically when the battery power of heavily utilized nodes decreases, without any global coordination or communication. In this paper we study the lifetime and delay of hierarchical neighbor graphs, giving analytical characterizations of both. We present the results of extensive simulations that demonstrate how the lifetime and delay vary with various network parameters and the parameter p, also studying the effects of applicationspecific data aggregation policies. Through this simulation study we compare hierarchical neighbor graphs against other leading proposals for data collection in wireless sensor networks and demonstrate that in general our structure provides better lifetime values, and, importantly, is able to deal with heterogeneous distributions of initial battery power much better than previous proposals.

show abstract

Section: A Related Workmentioning

confidence: 91%

A computationally inexpensive and power efficient fully distributed topology for data collection in heterogeneous wireless sensor networks

Bagchi

Madan

Premi

2011

2011 International Conference on Distributed Computing in Sensor Systems and Workshops (DCOSS)

View full text Add to dashboard Cite

show abstract

“…These techniques use static route to forward or aggregate data without considering the location, residual energy or other routing metrics of the deployed nodes for making decision to construct a routing path dynamically. Some traditional data aggregation protocols that use such routing or aggregation mechanism are LEACH [13], PEGASIS [18], improved PEGASIS [19], PEDAP [29], COSEN [28], BERP [15], TL-LEACH [20], TB-LEACH [12], CHIRON [4], CREEC [25], EECF [17], EA-COSEN [26] etc. These protocols are suitable for data gathering applications and performs well in static wireless sensor networks.…”

Section: Related Workmentioning

confidence: 99%

Evaluation and Comparative Study of Structure Free Aggregation Techniques for Duty Cycled Wireless Sensor Networks

Sran¹,

Kaur²

2017

IJCA

View full text Add to dashboard Cite

For delay sensitive event based applications, structure free data aggregation approach has been found to be more suitable because of the reduced structure maintenance overhead. However, in the literature, it has been observed that increasing the delay at intermediate sensor node increases aggregation and the event notification time. The objective is to investigate various structure free aggregation schemes in terms of aggregation gain, event notification time and the overall energy consumption. To achieve this objective, a comparative study of various structure free aggregation techniques is presented. First, we investigate the potential of aggregation in different structure free aggregation techniques for duty cycled sensor networks. Then the performance of the aggregation techniques is demonstrated with the help of simulations on Cooja network simulator in Contiki operating system. From the results, it has been observed that Tuned delay based aggregation scheme reduces energy consumption (upto 13%) as compared to Collect protocol. Moreover, it reduces the worst event notification time (upto 20%) in comparison to random delay based aggregation scheme.

show abstract

“…They are clustering based [4], tree-based [8], and chain-based [9]. In this section, we only review three chain-based routing protocols, PEGASIS [9], COSEN [10], and Enhanced PEGASIS [9], and point out their pros and cons.…”

Section: Introductionmentioning

confidence: 99%

“…B) COSEN In contrast to PEGASIS, COSEN [10] is a two-tier hierarchical chain-based routing scheme. In that scheme, sensor nodes are geographically grouped into several lowlevel chains.…”

Section: Introductionmentioning

confidence: 99%

Energy Efficient Path Determination in Wireless Sensor Network Using BFS Approach

Mahajan¹,

Malhotra²

2011

WSN

View full text Add to dashboard Cite

The wireless sensor networks (WSN) are formed by a large number of sensor nodes working together to provide a specific duty. However, the low energy capacity assigned to each node prompts users to look at an important design challenge such as lifetime maximization. Therefore, designing effective routing techniques that conserve scarce energy resources is a critical issue in WSN. Though, the chain-based routing is one of significant routing mechanisms but several common flaws, such as data propagation delay and redundant transmission, are associated with it. In this paper, we will be proposing an energy efficient technique based on graph theory that can be used to find out minimum path based on some defined conditions from a source node to the destination node. Initially, a sensor area is divided into number of levels by a base station based on signal strength. It is important to note that this technique will always found out minimum path and even alternate path are also saved in case of node failure.

show abstract

COSEN: A Chain Oriented Sensor Network for Efficient Data Collection

Cited by 65 publications

References 16 publications

A computationally inexpensive and power efficient fully distributed topology for data collection in heterogeneous wireless sensor networks

A computationally inexpensive and power efficient fully distributed topology for data collection in heterogeneous wireless sensor networks

Evaluation and Comparative Study of Structure Free Aggregation Techniques for Duty Cycled Wireless Sensor Networks

Energy Efficient Path Determination in Wireless Sensor Network Using BFS Approach

Contact Info

Product

Resources

About