Efficient design techniques for reliable wireless backhaul networks

Conference proceedings article


ผู้เขียน/บรรณาธิการ


กลุ่มสาขาการวิจัยเชิงกลยุทธ์

ไม่พบข้อมูลที่เกี่ยวข้อง


รายละเอียดสำหรับงานพิมพ์

รายชื่อผู้แต่งLeesutthipornchai P., Wattanapongsakorn N., Charnsripinyo C.

ผู้เผยแพร่Hindawi

ปีที่เผยแพร่ (ค.ศ.)2008

หน้าแรก22

หน้าสุดท้าย27

จำนวนหน้า6

ISBN9781424423361

นอก0146-9428

eISSN1745-4557

URLhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-67549133145&doi=10.1109%2fISCIT.2008.4700148&partnerID=40&md5=c4c27a6a49af7842d4625b482b65ab24

ภาษาEnglish-Great Britain (EN-GB)


ดูในเว็บของวิทยาศาสตร์ | ดูบนเว็บไซต์ของสำนักพิมพ์ | บทความในเว็บของวิทยาศาสตร์


บทคัดย่อ

The issues of network performance and reliability in wireless access networks have become indispensable due to the increasing needs for communication services anywhere and anytime. Traditional design of wireless backhaul networks has a simple tree-like structure which is vulnerable to network failures. To protect services against network component/facility breakdown, reliable network design is required. However, the complexity of reliable network design is a well-known problem. Various techniques have been proposed to find a minimum-cost solution in a reliable network design. In this paper, we propose and compare two different approaches which are network link restoration and network path restoration for reliable wireless backhaul network design. These restoration techniques provide fault tolerance to tree topology in traditional cellular network design, so that any breakdown of single link or multiple links within a network path can no longer interrupt the network services. As a result, the network design with backup path using restoration approaches can greatly enhance the network reliability and quality of services. We also show that a well-known shortest path algorithm can be efficiently applied as a meta- heuristic technique for both link restoration and path restoration approaches in a reliable wireless backhaul network design. ฉ 2008 IEEE.


คำสำคัญ

ไม่พบข้อมูลที่เกี่ยวข้อง


อัพเดทล่าสุด 2023-27-09 ถึง 07:35