Heuristic routing with bandwidth and energy constraints in sensor networks |
| |
| Affiliation: | 1. Mepco Schlenk Engineering College (Autonomous), Sivakasi, India;2. Department of IT, Mepco Schlenk Engineering College (Autonomous), Sivakasi, India;3. Department of CSE, Mepco Schlenk Engineering College (Autonomous), Sivakasi, India;4. Department of CSE, Ramco Institute of Technology, Rajapalayam, India;1. School of Management and Economics, University of Electronic Science and Technology of China, Chengdu 610054, China;2. Department of Electrical and Computer Engineering, University of Alberta, Edmonton, Alberta, Canada T6G 2G7;3. System Research Institute, Polish Academy of Sciences, Warsaw, Poland;4. School of Economics and Management, Southwest Jiaotong University, Chengdu 610031, China;5. Department of Electrical and Computer Engineering, Faculty of Engineering, King Abdulaziz University, Jeddah 21589, Saudi Arabia;1. School of Information Science & Engineering, Central South University, Changsha, Hunan 410083, China;2. Research Organization of Information and Systems, 4-3-13 Toranomon, Minato-ku, Tokyo 105-0001, Japan;3. The Institute of Statistical Mathematics, 10-3 Midori-cho, Tachikawa, Tokyo 190-8562, Japan;4. Hunan Province Higher Education Key Laboratory of Power System Safety Operation and Control, Changsha University of Science and Technology, Changsha, Hunan 410004, China;5. School of Business, Central South University, Changsha, Hunan 410083, China;6. Collaborative Innovation Center of Resource-Conserving & Environment-Friendly Society and Ecological Civilization, Changsha, Hunan 410083, China;1. Department of Electrical Engineering, Asansol Engineering College, Asansol, West Bengal, India;2. Department of Electrical Engineering, Indian School of Mines, Dhanbad, Jharkhand, India;3. Department of Electrical Engineering, National Institute of Technology, Durgapur, West Bengal, India;1. Samsung Electronics, Republic of Korea;2. Intelligent Systems and Emotional Engineering (ISEE) Laboratory, Department of Mechatronics Engineering, Chungnam National University, Republic of Korea |
| |
| Abstract: | Most of the routing algorithms devised for sensor networks considered either energy constraints or bandwidth constraints to maximize the network lifetime. In the real scenario, both energy and bandwidth are the scarcest resource for sensor networks. The energy constraints affect only sensor routing, whereas the link bandwidth affects both routing topology and data rate on each link. Therefore, a heuristic technique that combines both energy and bandwidth constraints for better routing in the wireless sensor networks is proposed. The link bandwidth is allocated based on the remaining energy making the routing solution feasible under bandwidth constraints. This scheme uses an energy efficient algorithm called nearest neighbor tree (NNT) for routing. The data gathered from the neighboring nodes are also aggregated based on averaging technique in order to reduce the number of data transmissions. Experimental results show that this technique yields good solutions to increase the sensor network lifetime. The proposed work is also tested for wildfire application. |
| |
| Keywords: | Sensor networks routing Bandwidth constraint Energy constraint Nearest neighbor tree Distributed algorithm Maximum lifetime |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
