A Novel Collaboration Scheme for Multi-Channel/Interface Network Coding

Seok-Chul Kwon; Hendessi, F.; Fekri, F.; Stüber, G.L.;
Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA

Keywords

Multi-channel/multi-interface , channel assignment , network coding , wireless ad hoc network

Abstract

Multi-channel, multi-interface ad hoc wireless networks can obtain substantial capacity improvements by mitigating co-channel interference. Channel assignment and routing algorithms that relieve co-channel interference and balance traffic loads are critical for obtaining these large capacity increases. However, with a limited number of channels and interfaces, this approach cannot avoid traffic overload as the network traffic increases. This paper proposes a novel scheme of multi-channel/interface network coding that is based on the combination of a new concept of coded-overhearing and coding-aware channel assignment. The proposed algorithms overcome the radio coverage limitations present in conventional network coding schemes, and exhibit improved flexibility in terms of aggregate throughput when there are an insufficient number of interfaces and a outage of network coding opportunities. Our scheme attains significant improvement in the aggregate throughput as compared to a no network coding scheme.

This paper appears in: Wireless Communications, IEEE Transactions on
Issue Date: January 2011
Volume: 10 Issue:1
On page(s): 188 - 198
ISSN: 1536-1276

Disseminating a Large Amount of Data to Vehicular Network in an Urban Area

Mina Taheri and Faramarz Hendesi
Department of Electrical and Computer Engineering, Isfahan University of Technology, Esfahan 84156-83111, Iran

Keywords

VANET, Data Disseminating

Abstract

The problem of distributing a large amount of data from multiple sources in an urban area is investigated. We explore an opportunistic approach for information collection, in which a vehicle obtains information about resources from encountered vehicles. This protocol could be applied in both dense and sparse vehicular networks. Due to the highly dynamic nature of the underlying vehicular network topology, we depart from architectures requiring centralized coordination, reliable MAC scheduling, or global network state knowledge, and instead adopt a distributed paradigm with simple protocols. In other words, a reliable dissemination is introduced from multiple sources when each node in the network shares a limited amount of its resources for cooperating with others. By using rateless coding at the Road Side Unit (RSU) and using vehicles as data carriers, an efficient way to achieve reliable dissemination to all nodes (even disconnected clusters in the network) is described.

This paper appears in: International Journal of Vehicular Technology
Issue Date: January 2011
Volume: 2011

A Novel Collaboration Scheme for Multi-Channel/Interface Network Coding

Seok-Chul Kwon; Hendessi, F.; Fekri, F.; Stüber, G.L.;
Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA

Keywords

Multi-channel/multi-interface , channel assignment , network coding , wireless ad hoc network

Abstract

Multi-channel, multi-interface ad hoc wireless networks can obtain substantial capacity improvements by mitigating co-channel interference. Channel assignment and routing algorithms that relieve co-channel interference and balance traffic loads are critical for obtaining these large capacity increases. However, with a limited number of channels and interfaces, this approach cannot avoid traffic overload as the network traffic increases. This paper proposes a novel scheme of multi-channel/interface network coding that is based on the combination of a new concept of coded-overhearing and coding-aware channel assignment. The proposed algorithms overcome the radio coverage limitations present in conventional network coding schemes, and exhibit improved flexibility in terms of aggregate throughput when there are an insufficient number of interfaces and a outage of network coding opportunities. Our scheme attains significant improvement in the aggregate throughput as compared to a no network coding scheme.

This paper appears in: Wireless Communications, IEEE Transactions on
Issue Date: January 2011
Volume: 10 Issue:1
On page(s): 188 - 198
ISSN: 1536-1276

Disseminating a Large Amount of Data to Vehicular Network in an Urban Area

Mina Taheri and Faramarz Hendesi
Department of Electrical and Computer Engineering, Isfahan University of Technology, Esfahan 84156-83111, Iran

Keywords

VANET, Data Disseminating

Abstract

The problem of distributing a large amount of data from multiple sources in an urban area is investigated. We explore an opportunistic approach for information collection, in which a vehicle obtains information about resources from encountered vehicles. This protocol could be applied in both dense and sparse vehicular networks. Due to the highly dynamic nature of the underlying vehicular network topology, we depart from architectures requiring centralized coordination, reliable MAC scheduling, or global network state knowledge, and instead adopt a distributed paradigm with simple protocols. In other words, a reliable dissemination is introduced from multiple sources when each node in the network shares a limited amount of its resources for cooperating with others. By using rateless coding at the Road Side Unit (RSU) and using vehicles as data carriers, an efficient way to achieve reliable dissemination to all nodes (even disconnected clusters in the network) is described.

This paper appears in: International Journal of Vehicular Technology
Issue Date: January 2011
Volume: 2011

Cooperative Network Coding and Coding-Aware Channel Assignment in Multi-Channel, Multi-Interface Wireless Networks

Seok-Chul Kwon; Hendessi, F.; Fekri, F.;
Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA

Keywords

Network Coding, Ad-hoc, Multi channel

Abstract

Efforts to improve the capacity of multi-channel, multi-interface wireless mesh networks have mainly focused on mitigating channel interference and balancing traffic loads. In a limited number of channels and interfaces, this approach cannot help encountering the network overload and traffic saturation, as network traffic increases. It will be serious, especially at intersecting nodes such as the nodes around gateways for last-mile connectivity. Considering this situation, which degrades the aggregate throughput of networks, a more aggressive strategy to cope with network traffic saturation is necessary. We propose a novel cooperative network coding scheme, which exploits coded-overhearing, for unicast in multi-channel, multi-interface wireless mesh networks. Further, we present a coding-aware channel assignment algorithm with new metrics to support our network coding scheme, resulting in substantial improvement in the aggregate throughput. The combination of the proposed network coding scheme and the channel assignment algorithm contributes to overcoming geographical limitations in conventional network coding. It also shows better flexibility for the insufficient number of interfaces and the outage of coding opportunities. Our evaluation results show maximally a 52% improvement in terms of the aggregate throughput by using our coded-overhearing algorithm with a coding-aware channel assignment.

This paper appears in: Sensor, Mesh and Ad Hoc Communications and Networks, 2009. SECON '09. 6th Annual IEEE Communications Society Conference on
Issue Date:June 2009
On page(s): 1 - 9

Infocast: A New Paradigm for Collaborative Content Distribution from Roadside Units to Vehicular Networks

Sardari, M.; Hendessi, F.; Fekri, F.;
Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA

Keywords

VANET, Data Distribution

Abstract

In this paper, we address the problem of distributing a large amount of bulk data to a sparse vehicular network from roadside infostations, using efficient vehicle-to-vehicle collaboration. Due to the highly dynamic nature of the underlying vehicular network topology, we depart from architectures requiring centralized coordination, reliable MAC scheduling, or global network state knowledge, and instead adopt a distributed paradigm with simple protocols. In other words, we investigate the problem of reliable dissemination from multiple sources when each node in the network shares a limited amount of its resources for cooperating with others. By using rateless coding at the Road Side Unit (RSU) and using vehicles as data carriers, we describe an efficient way to achieve reliable dissemination to all nodes (even disconnected clusters in the network). In the nutshell, we explore vehicles as mobile storage devices. We then develop a method to keep the density of the rateless codes packets as a function of distance from the RSU at the desired level set for the target decoding distance. We investigate various tradeoffs involving buffer size, maximum capacity, and the mobility parameter of the vehicles.

This paper appears in: Sensor, Mesh and Ad Hoc Communications and Networks, 2009. SECON '09. 6th Annual IEEE Communications Society Conference on
Issue Date:June 2009
On page(s): 1 - 9

Cooperative Network Coding and Coding-Aware Channel Assignment in Multi-Channel, Multi-Interface Wireless Networks

Seok-Chul Kwon; Hendessi, F.; Fekri, F.;
Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA

Keywords

Network Coding, Ad-hoc, Multi channel

Abstract

Efforts to improve the capacity of multi-channel, multi-interface wireless mesh networks have mainly focused on mitigating channel interference and balancing traffic loads. In a limited number of channels and interfaces, this approach cannot help encountering the network overload and traffic saturation, as network traffic increases. It will be serious, especially at intersecting nodes such as the nodes around gateways for last-mile connectivity. Considering this situation, which degrades the aggregate throughput of networks, a more aggressive strategy to cope with network traffic saturation is necessary. We propose a novel cooperative network coding scheme, which exploits coded-overhearing, for unicast in multi-channel, multi-interface wireless mesh networks. Further, we present a coding-aware channel assignment algorithm with new metrics to support our network coding scheme, resulting in substantial improvement in the aggregate throughput. The combination of the proposed network coding scheme and the channel assignment algorithm contributes to overcoming geographical limitations in conventional network coding. It also shows better flexibility for the insufficient number of interfaces and the outage of coding opportunities. Our evaluation results show maximally a 52% improvement in terms of the aggregate throughput by using our coded-overhearing algorithm with a coding-aware channel assignment.

This paper appears in: Sensor, Mesh and Ad Hoc Communications and Networks, 2009. SECON '09. 6th Annual IEEE Communications Society Conference on
Issue Date:June 2009
On page(s): 1 - 9

Infocast: A New Paradigm for Collaborative Content Distribution from Roadside Units to Vehicular Networks

Sardari, M.; Hendessi, F.; Fekri, F.;
Sch. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA

Keywords

VANET, Data Distribution

Abstract

In this paper, we address the problem of distributing a large amount of bulk data to a sparse vehicular network from roadside infostations, using efficient vehicle-to-vehicle collaboration. Due to the highly dynamic nature of the underlying vehicular network topology, we depart from architectures requiring centralized coordination, reliable MAC scheduling, or global network state knowledge, and instead adopt a distributed paradigm with simple protocols. In other words, we investigate the problem of reliable dissemination from multiple sources when each node in the network shares a limited amount of its resources for cooperating with others. By using rateless coding at the Road Side Unit (RSU) and using vehicles as data carriers, we describe an efficient way to achieve reliable dissemination to all nodes (even disconnected clusters in the network). In the nutshell, we explore vehicles as mobile storage devices. We then develop a method to keep the density of the rateless codes packets as a function of distance from the RSU at the desired level set for the target decoding distance. We investigate various tradeoffs involving buffer size, maximum capacity, and the mobility parameter of the vehicles.

This paper appears in: Sensor, Mesh and Ad Hoc Communications and Networks, 2009. SECON '09. 6th Annual IEEE Communications Society Conference on
Issue Date:June 2009
On page(s): 1 - 9

بررسي كدهاي متعامد و كاربرد آنها در مخابرات سيار

جمشيد ابوئي
دانشکده برق و کامپيوتر، دانشگاه صنعتي اصفهان

استاد راهنما : فرامرز هندسي
استادمشاور :

توصيفگر ها

كدها◄متعامد◄كاربرد◄مخابرات ◄سيار◄توابع◄پريوديك ◄گولد◄خطي ◄پيچيدگي ◄دنباله ◄غيرباينري◄كد◄كازامي ◄بنت ◄مكالمه ◄فاز◄تقسيم بندي◄ظرفيت ◄تلفن سيار

خلاصه

بررسي كدهاي متعامد و كاربرد آنها در مخابرات سيار

جمشيد ابوئي
دانشکده برق و کامپيوتر، دانشگاه صنعتي اصفهان

استاد راهنما : فرامرز هندسي
استادمشاور :

توصيفگر ها

كدها◄متعامد◄كاربرد◄مخابرات ◄سيار◄توابع◄پريوديك ◄گولد◄خطي ◄پيچيدگي ◄دنباله ◄غيرباينري◄كد◄كازامي ◄بنت ◄مكالمه ◄فاز◄تقسيم بندي◄ظرفيت ◄تلفن سيار

خلاصه