Abstract
Wireless Sensor Network (WSN) is distinctive of conventional Ad-Hoc networks with the limited battery and memory capacity. Moreover, it is not hard to see that coverage of sensor nodes possibly densely deployed due to cheap prices of the nodes, frequently overlaps with each other. Considering those facts - possible duplication of receiving data and limited battery capacity - WSN particularly requires energy efficient routing algorithm. Hence, we find drawbacks according to analysis of various routing algorithms in sensor network and introduce optimizing method for energy efficiency. After an INTEREST message has been dissipated from a sink, each sensor node which receives data senses and sends the data to the sink. This paper overcomes various limitations such as scarcity of battery capacity, overlapped coverage of nodes and data duplication with randomly choosing a node that has a smaller hop count and reasonably high energy when a node selects the next hop. This algorithm enables to optimize energy efficiency as the nodes that are not involved in transmission are turned into sleep mode and therefore saves more energy.
| Original language | English |
|---|---|
| Title of host publication | Fourth International Conference on Information Technology and Applications, ICITA 2007 |
| Pages | 135-138 |
| Number of pages | 4 |
| Publication status | Published - 2007 Dec 3 |
| Event | 4th International Conference on Information Technology and Applications, ICITA 2007 - Harbin, China Duration: 2007 Jan 15 → 2007 Jan 18 |
Other
| Other | 4th International Conference on Information Technology and Applications, ICITA 2007 |
|---|---|
| Country | China |
| City | Harbin |
| Period | 07/1/15 → 07/1/18 |
Fingerprint
Keywords
- Energy efficient
- Random
- Routing algorithm
- Select
- Wireless sensor network
ASJC Scopus subject areas
- Computer Science(all)
Cite this
An energy efficient routing algorithm with random selection in wireless sensor networks. / Lee, In Sook; Kim, Jung Hwan; Park, Myong Soon.
Fourth International Conference on Information Technology and Applications, ICITA 2007. 2007. p. 135-138.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - An energy efficient routing algorithm with random selection in wireless sensor networks
AU - Lee, In Sook
AU - Kim, Jung Hwan
AU - Park, Myong Soon
PY - 2007/12/3
Y1 - 2007/12/3
N2 - Wireless Sensor Network (WSN) is distinctive of conventional Ad-Hoc networks with the limited battery and memory capacity. Moreover, it is not hard to see that coverage of sensor nodes possibly densely deployed due to cheap prices of the nodes, frequently overlaps with each other. Considering those facts - possible duplication of receiving data and limited battery capacity - WSN particularly requires energy efficient routing algorithm. Hence, we find drawbacks according to analysis of various routing algorithms in sensor network and introduce optimizing method for energy efficiency. After an INTEREST message has been dissipated from a sink, each sensor node which receives data senses and sends the data to the sink. This paper overcomes various limitations such as scarcity of battery capacity, overlapped coverage of nodes and data duplication with randomly choosing a node that has a smaller hop count and reasonably high energy when a node selects the next hop. This algorithm enables to optimize energy efficiency as the nodes that are not involved in transmission are turned into sleep mode and therefore saves more energy.
AB - Wireless Sensor Network (WSN) is distinctive of conventional Ad-Hoc networks with the limited battery and memory capacity. Moreover, it is not hard to see that coverage of sensor nodes possibly densely deployed due to cheap prices of the nodes, frequently overlaps with each other. Considering those facts - possible duplication of receiving data and limited battery capacity - WSN particularly requires energy efficient routing algorithm. Hence, we find drawbacks according to analysis of various routing algorithms in sensor network and introduce optimizing method for energy efficiency. After an INTEREST message has been dissipated from a sink, each sensor node which receives data senses and sends the data to the sink. This paper overcomes various limitations such as scarcity of battery capacity, overlapped coverage of nodes and data duplication with randomly choosing a node that has a smaller hop count and reasonably high energy when a node selects the next hop. This algorithm enables to optimize energy efficiency as the nodes that are not involved in transmission are turned into sleep mode and therefore saves more energy.
KW - Energy efficient
KW - Random
KW - Routing algorithm
KW - Select
KW - Wireless sensor network
UR - http://www.scopus.com/inward/record.url?scp=36448940069&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=36448940069&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:36448940069
SN - 0980326702
SN - 9780980326703
SP - 135
EP - 138
BT - Fourth International Conference on Information Technology and Applications, ICITA 2007
ER -