miun.sePublications
Change search
Link to record
Permanent link

Direct link
BETA
Publications (10 of 12) Show all publications
Muneer, S., Eriksson, M. & Shahzad, K. (2015). Single Frequency Network based Distributed Cooperative Routing: with CSMA MAC. In: Proceedings - 2015 13th International Conference on Frontiers of Information Technology, FIT 2015: . Paper presented at FIT 2015-I3th IEEE International Conference on Frontiers of Information Technology, 14 - 16 December (pp. 246-251). Islamabad, Article ID 7421008.
Open this publication in new window or tab >>Single Frequency Network based Distributed Cooperative Routing: with CSMA MAC
2015 (English)In: Proceedings - 2015 13th International Conference on Frontiers of Information Technology, FIT 2015, Islamabad, 2015, p. 246-251, article id 7421008Conference paper, Published paper (Refereed)
Abstract [en]

The multi-hop ad-hoc networking paradigm isexpected to be a key feature in future wireless communicationsystems. In a typical data broadcast scenario, multi-hop ad-hocrouting protocols allow devices (called nodes in this paper) tocommunicate and form networks in a manner to enable them tosuccessfully communicate and share information with all othernodes. To ensure maximum reachability in a multi-hop network,the concept of cooperative diversity, in which multiple nodescooperate to transmit the same data to a destination, can beapplied. The cooperative diversity is best exploited with the use ofSingle Frequency Networks (SFNs), also known as a form ofMacro-diversity. This work comprises of a design and analysis ofan SFN based distributed cooperative routing protocol (SFNDCRP)for multi-hop ad-hoc networks with a focus on routinginitiation phase with CSMA as a synchronization mechanism. Theproposed protocol is proactive and incurs minimum per packetdelay. The total delay in routing initiation phase for a network ofn nodes is identified as a problem of n2+2n. A delivery rate orreachability improvement of up-to 36% points for a node isobserved for the SFN based protocol as compared to a non-SFNbased protocol. For synchronization, a CSMA MAC protocol isdeployed for which a deficiency of only less than 0.1 percent existsin the measurements due to collisions in the network.

Place, publisher, year, edition, pages
Islamabad: , 2015
Keywords
Cooperative Diversity, SFN, Prowler, Multi-hop Networks, Routing, Broadcast, MAC
National Category
Communication Systems
Identifiers
urn:nbn:se:miun:diva-26961 (URN)10.1109/FIT.2015.50 (DOI)000380378000041 ()2-s2.0-84964603310 (Scopus ID)
Conference
FIT 2015-I3th IEEE International Conference on Frontiers of Information Technology, 14 - 16 December
Note

Kommer att bli tillgängligt via IEEE Explore och på http://fit.edu.pk/

Available from: 2016-02-01 Created: 2016-02-01 Last updated: 2017-10-27Bibliographically approved
Eriksson, M., Rahman, S. M., Fraile, F. & Sjöström, M. (2013). Efficient Interactive Multicast over DVB-T2: Utilizing Dynamic SFNs and PARPS. In: IEEE International Symposium on Broadband Multimedia Systems and Broadcasting, BMSB: . Paper presented at 8th IEEE International Symposium on Broadband Multimedia Systems and Broadcasting, BMSB 2013; London; United Kingdom; 4 June 2013 through 7 June 2013; Category numberCFP13BRO-ART; Code 100792 (pp. Art. no. 6621700). IEEE conference proceedings
Open this publication in new window or tab >>Efficient Interactive Multicast over DVB-T2: Utilizing Dynamic SFNs and PARPS
2013 (English)In: IEEE International Symposium on Broadband Multimedia Systems and Broadcasting, BMSB, IEEE conference proceedings, 2013, p. Art. no. 6621700-Conference paper, Published paper (Refereed)
Abstract [en]

In the terrestrial digital TV systems DVB-T/H/T2, broadcasting is employed, meaning that all TV programs are sent over all transmitters, also where there are no viewers. This is inefficient utilization of spectrum and transmitter equipment. Applying interactive multicasting over DVB-T2 is a novel approach that would substantially reduce the spectrum required to deliver a certain amount of TV programs. Further gain would be achieved by Dynamic single-frequency network (DSFN) formations, which can be implemented using the concept of PARPS (Packet and Resource Plan Scheduling). A Zipf-law heterogeneous program selection model is suggested. For a system of four coordinated transmitters, and certain assumptions, IP multicasting over non-continuous transmission DSFN gives 1740% increase in multiuser system spectral efficiency (MSSE) in (users∙bit/s)/Hz/site as compared to broadcasting over SFN.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2013
Keywords
Digital Video Broadcasting, IP Multicast, DSFN, LSA, IP-TV, Mobile-TV, Zipf, DVB-T2, eMBMS, MB-SFN, cooperative macro-diversity, dynamic broadcast.
National Category
Communication Systems
Identifiers
urn:nbn:se:miun:diva-19142 (URN)10.1109/BMSB.2013.6621700 (DOI)000342351500026 ()2-s2.0-84887836528 (Scopus ID)STC (Local ID)978-146736047-0 (ISBN)STC (Archive number)STC (OAI)
Conference
8th IEEE International Symposium on Broadband Multimedia Systems and Broadcasting, BMSB 2013; London; United Kingdom; 4 June 2013 through 7 June 2013; Category numberCFP13BRO-ART; Code 100792
Projects
Realistic 3D
Available from: 2013-06-10 Created: 2013-06-10 Last updated: 2017-08-22Bibliographically approved
Eriksson, M. & Mahmud, A. (2010). Dynamic single frequency networks in wireless multihop networks: Energy aware routing algorithms with performance analysis. In: Proceedings - 10th IEEE International Conference on Computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, ScalCom-2010: . Paper presented at 10th IEEE International Conference on Computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, 10th IEEE Int. Conf. Scalable Computing and Communications, ScalCom-2010; Bradford; 29 June 2010 through 1 July 2010; Category number E4108; Code 82049 (pp. 400-406). IEEE conference proceedings
Open this publication in new window or tab >>Dynamic single frequency networks in wireless multihop networks: Energy aware routing algorithms with performance analysis
2010 (English)In: Proceedings - 10th IEEE International Conference on Computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, ScalCom-2010, IEEE conference proceedings, 2010, p. 400-406Conference paper, Published paper (Refereed)
Abstract [en]

A new approach to improving the energy consumption and node reachability of multihop networks is to dynamically combine multihop routing with single-frequency networks (transmitter macrodiversity), i.e. several nodes sending the same signal simultaneously over the same frequency channel. Four routing algorithms are suggested and evaluated for a broadcasting scenario. Simulation results show that the best algorithm reduces the energy consumption by up to 42% in comparison to non-SFN multihop routing for the same node reachability. SFN-based multihop routing improves the reachability by up to 37 percentage points as compared to non-SFN routing. A 3.8 dB diversity gain is observed that allows a 54% higher data rate for the same bit error probability. By restricting the SFN sizes to a maximum number of nodes, the energy efficiency may be improved while the reachability is deteriorated.

Place, publisher, year, edition, pages
IEEE conference proceedings, 2010
Keywords
DSFN; Macrodiversity; MANET; Multihop routing; Sensor networks; SFN; Simulcasting; UWB
National Category
Computer and Information Sciences
Identifiers
urn:nbn:se:miun:diva-12641 (URN)10.1109/CIT.2010.95 (DOI)2-s2.0-78249267596 (Scopus ID)978-076954108-2 (ISBN)
Conference
10th IEEE International Conference on Computer and Information Technology, CIT-2010, 7th IEEE International Conference on Embedded Software and Systems, ICESS-2010, 10th IEEE Int. Conf. Scalable Computing and Communications, ScalCom-2010; Bradford; 29 June 2010 through 1 July 2010; Category number E4108; Code 82049
Available from: 2010-12-13 Created: 2010-12-13 Last updated: 2018-01-12Bibliographically approved
Eriksson, M. & Mahmud, A. (2010). Transmitter Macrodiversity in Multihopping: SFN based algorithm for improved node reachability and robust routing. In: World Academy of Science, Engineering and Technology (WASET) International Conference on Computer Science and Technology (ICCST’10), Rome, Italy, 28-30 April 2010: . Paper presented at International Conference on Computer Science and Technology (ICCST’10) (pp. 404-408). Rome, Italy
Open this publication in new window or tab >>Transmitter Macrodiversity in Multihopping: SFN based algorithm for improved node reachability and robust routing
2010 (English)In: World Academy of Science, Engineering and Technology (WASET) International Conference on Computer Science and Technology (ICCST’10), Rome, Italy, 28-30 April 2010, Rome, Italy, 2010, p. 404-408Conference paper, Published paper (Refereed)
Abstract [en]

A novel idea presented in this paper is to combine multihop routing with single-frequency networks (SFNs) for a broadcasting scenario. An SFN is a set of multiple nodes that transmit the same data simultaneously, resulting in transmitter macrodiversity. Two of the most important performance factors of multihop networks, node reachability and routing robustness, are analyzed. Simulation results show that our proposed SFN-D routing algorithm improves the node reachability by 37 percentage points as compared to non-SFN multihop routing. It shows a diversity gain of 3.7 dB, meaning that 3.7 dB lower transmission powers are required for the same reachability. Even better results are possible for larger networks. If an important node becomes inactive, this algorithm can find new routes that a non-SFN scheme would not be able to find. Thus, two of the major problems in multihopping are addressed; achieving robust routing as well as improving node reachability or reducing transmission power.

Place, publisher, year, edition, pages
Rome, Italy: , 2010
Keywords
Broadcasting; Dsfn; Manet; Multihop routing; OFDM; Single-frequency networks (sfn); Transmitter macrodiversity
National Category
Communication Systems
Identifiers
urn:nbn:se:miun:diva-15975 (URN)2-s2.0-78651540228 (Scopus ID)
Conference
International Conference on Computer Science and Technology (ICCST’10)
Available from: 2012-05-25 Created: 2012-03-02 Last updated: 2016-09-22Bibliographically approved
Eriksson, M. (2001). Dynamic Single Frequency Networks. IEEE Journal on Selected Areas in Communications, 19(10), 1905-1914
Open this publication in new window or tab >>Dynamic Single Frequency Networks
2001 (English)In: IEEE Journal on Selected Areas in Communications, ISSN 0733-8716, E-ISSN 1558-0008, Vol. 19, no 10, p. 1905-1914Article in journal (Refereed) Published
Abstract [en]

Wireless asymmetric Internet access with a downlink peak bit rate of 10 to 30 Mb/s can be achieved by using the terrestrial digital video broadcasting system (DVB-T) as a supplemental downlink together with today's cellular systems. This paper is a study of dynamic radio resource management on a packet-by-packet basis for this broadband downlink. The dynamic single frequency networks (DSFN) scheme is evaluated. It exploits the macrodiversity capability of the OFDM modulation scheme. The transmitters are dynamically divided into groups of transmitters that send the same information at the same channel frequency simultaneously. The fairly shared spectrum efficiency (FSSE), in bits per second per Hertz per site, which is a combined measurement of maximum throughput and fairness, is evaluated for best-effort traffic. DSFN improves the FSSE by 100% to 370%, for a certain set of test cases, in comparison to the dynamic packet assignment (DPA) scheme, which combines packet scheduling with dynamic channel assignment (DCA).

Keywords
DPA, DSFN, DVB-T, fairness, FSSE, macrodiversity, OFDM, scheduling, SFN, DVB-T
National Category
Computer Sciences
Identifiers
urn:nbn:se:miun:diva-1964 (URN)10.1109/49.957306 (DOI)000171610700008 ()2-s2.0-0035482894 (Scopus ID)818 (Local ID)818 (Archive number)818 (OAI)
Available from: 2008-09-30 Created: 2008-09-30 Last updated: 2018-01-12Bibliographically approved
Eriksson, M. (2001). Evaluation of Packet-by-Packet Downlink Radio Resource Management Schemes. In: IEEE VTS 53rd vehicular technology conference, 2001. VTC 2001 spring, vol. 2: (pp. 967-971).
Open this publication in new window or tab >>Evaluation of Packet-by-Packet Downlink Radio Resource Management Schemes
2001 (English)In: IEEE VTS 53rd vehicular technology conference, 2001. VTC 2001 spring, vol. 2, 2001, p. 967-971Conference paper, Published paper (Refereed)
Abstract [en]

The OFDM based terrestrial digital video broadcasting system (DVB-T) can be utilized for asymmetric Internet access with a downlink peak bit rate of 10-20Mbps. A narrow-band cellular communications system can be used as uplink. This paper is a comparison of centralized dynamic radio resource management schemes for this downlink packet radio system. Spectrum efficiency in bit/s/Hz/transmitter, and fairly shared spectrum efficiency in bit/s/Hz/transmitter, are evaluated for a best-effort traffic snapshot model. The Dynamic Packet Assignment (DPA) algorithm performs combined packet scheduling and rapid Dynamic Channel Allocation. Even better performance is achieved by the Dynamic Single Frequency Networks (DSFN) scheme. It exploits the macro-diversity capability of OFDM modulation. The base station transmitters are dynamically divided into groups that send the same information at the same channel frequency simultaneously.

Keywords
DPA, Dynamic Packet Assignment, DCA, fairness, best-effort traffic, spectrum efficiency, scheduling, OFDM, macro-diversity, SFN, DSFN, DVB-T
National Category
Computer Sciences
Identifiers
urn:nbn:se:miun:diva-1963 (URN)10.1109/VETECS.2001.944522 (DOI)817 (Local ID)0-7803-6728-6 (ISBN)817 (Archive number)817 (OAI)
Available from: 2008-09-30 Created: 2008-09-30 Last updated: 2018-01-12Bibliographically approved
Eriksson, M. (2000). Packet and Resource Plan Scheduling (PARPS) - with Application to Mobile IP over DVB-T. In: Willie W. LU (Ed.), Proceedings of The 2000 International Conference on Broadband Wireless Access Systems (WAS2000), 4-6 December 2000, San Francisco, U.S.A..
Open this publication in new window or tab >>Packet and Resource Plan Scheduling (PARPS) - with Application to Mobile IP over DVB-T
2000 (English)In: Proceedings of The 2000 International Conference on Broadband Wireless Access Systems (WAS2000), 4-6 December 2000, San Francisco, U.S.A. / [ed] Willie W. LU, 2000Conference paper, Published paper (Other academic)
Abstract [en]

The Terrestrial Digital Video Broadcasting system (DVB-T) can be utilized as a supplemental broadband downlink to today´s cellular systems. Thus, mobile Internet access with downstream peek bit rates of 10 to 30 Mbit/s can be achieved. To make this concept competitive in comparison to for example UMTS, efficient Radio Resource Management (RRM) is essential. Schemes for downlink dynamic RRM on a packet-by-packet basis are suggested and evaluated for a simplified packet data model. Packet and Resource Plan Scheduling (PARPS) schemes reduce the problem of finding an optimized combination of several RRM parameters to a scheduling problem. Dynamic Single Frequency Networks (DSFN) and Virtual Cellular Networks (VCN) exploits the macro-diversity capability of the OFDM modulation scheme by dynamically forming groups of transmitters that send the same information on the same frequency channel simultaneously. Dynamic Packet Assignment (DPA) is a combination of Dynamic Channel Assignment (DCA) and packet scheduling. The Fairly Shared Spectrum Efficiency (FSSE), in bit/s/Hz/transmitter site, is improved by up to 370% for a certain test cases, by the DSFN scheme in comparison to DPA.

Keywords
IP over DVB, Mobility, Handover, PARPS, scheduling, fairness, FSSE, OFDM, macro-diversity, SFN, DSFN, Virtual Cellular Networks, VCN
National Category
Computer Sciences Telecommunications
Identifiers
urn:nbn:se:miun:diva-6171 (URN)1687 (Local ID)1687 (Archive number)1687 (OAI)
Available from: 2008-12-07 Created: 2008-12-07 Last updated: 2018-01-12Bibliographically approved
Eriksson, M. & Xu, Y. (2000). Packet-by-packet Radio Resource Management by means of Dynamic Single Frequency Networks: The 2000 International Conference on Broadband Wireless Access Systems (WAS'00), San Fransisco, U.S.A., December 4-6, 2000.
Open this publication in new window or tab >>Packet-by-packet Radio Resource Management by means of Dynamic Single Frequency Networks: The 2000 International Conference on Broadband Wireless Access Systems (WAS'00), San Fransisco, U.S.A., December 4-6, 2000
2000 (English)Conference paper, Published paper (Other academic)
Abstract [en]

By combining a cellular system with the terrestrial digital video broadcasting system (DVB-T), wide-area asymmetric Internet access can be achieved, with a downlink peak bit rate of 10-20Mbps. In this paper, we study dynamic resource management on a packet-by-packet basis for this broadband downlink. A model for best-effort traffic is proposed, which simplifies the evaluation of maximum throughput and fairness. Dynamic Single Frequency Networks (DSFN) are evaluated, which exploits the macrodiversity capability of the OFDM modulation scheme. The transmitters are divided into single frequency networks (SFNs), i.e. groups of transmitters that send the same information at the same channel frequency simultaneously. An algorithm changes the SFN grouping from timeslot to timeslot, and schedules the packets. DSFN is a way of introducing timeslots and Dynamic Channel Allocation into DVB-T, without keying of the transmitter power. Thus, receiver and transmitter circuits existing on the market today can be used, and only software modifications are required. A spectrum efficiency of 0.45 bit/s/Hz/site is achieved with omni-directional antennas under certain conditions. This is a capacity improvement of 170% in comparison to a Fixed Channel Allocation solution with static handover.

Keywords
fairness, best-effort traffic, spectrum efficiency, scheduling, OFDM, macro-diversity, SFN, DSFN
National Category
Computer Sciences Telecommunications
Identifiers
urn:nbn:se:miun:diva-1526 (URN)816 (Local ID)816 (Archive number)816 (OAI)
Available from: 2009-12-11 Created: 2009-12-04 Last updated: 2018-01-12Bibliographically approved
Eriksson, M. & Säterberg, H. (1999). Dynamic Radio Resource Management Schemes for Interactive Services in DVB-T and DAB. In: Proceedings of Radiovetenskap och kommunikation: Karlskrona 14-17 juni 1999 / RVK 99. Karlskrona: Högskolan i Karlskrona/Ronneby
Open this publication in new window or tab >>Dynamic Radio Resource Management Schemes for Interactive Services in DVB-T and DAB
1999 (English)In: Proceedings of Radiovetenskap och kommunikation: Karlskrona 14-17 juni 1999 / RVK 99, Karlskrona: Högskolan i Karlskrona/Ronneby , 1999Conference paper, Published paper (Other academic)
Abstract [en]

The topic of this paper is dynamic schemes for downlink packet radio resource management. The results can be applied to personal communication services in the terrestrial digital video and audio broadcasting systems (DVB-T and DAB). Dynamic single frequency networks (DSFN) are investigated, meaning that the macro diversity capability of the COFDM modulation scheme is utilised for cellular communication. The concept of PARPS (Packet and Resource Plan Scheduling) is introduced. PARPS reduces the combined problem of dynamic radio resource management, including DSFN, dynamic channel allocation, power control, link adaptation, etc, to a scheduling problem. We propose several optimised and heuristic PARPS schemes. Our results show that some of the heuristic schemes have near-optimal delay performance. We also have results indicating that the capacity of the PARPS schemes for 2D Poisson traffic can be evaluated with static analyses, i.e. without simulation of a queuing system.

Place, publisher, year, edition, pages
Karlskrona: Högskolan i Karlskrona/Ronneby, 1999
Keywords
PARPS, DVB-T, DAB, DSFN, SFN, OFDM, macro-diversity
National Category
Computer Sciences
Identifiers
urn:nbn:se:miun:diva-1961 (URN)813 (Local ID)91-630-8156-3 (ISBN)813 (Archive number)813 (OAI)
Available from: 2008-09-30 Created: 2009-12-04 Last updated: 2018-01-12Bibliographically approved
Eriksson, M. & Säterberg, H. (1999). The Concepts of PARPS: Packet and Resource Plan Scheduling. In: Multiaccess, Mobility and Teletraffic for Wireless Communications (MMT '99), Venice, Italy, October 6-8, 1999.
Open this publication in new window or tab >>The Concepts of PARPS: Packet and Resource Plan Scheduling
1999 (English)In: Multiaccess, Mobility and Teletraffic for Wireless Communications (MMT '99), Venice, Italy, October 6-8, 1999, 1999Conference paper, Published paper (Other academic)
Abstract [en]

Dynamic schemes for downlink packet radio resource management (RRM) are the topic of this paper. The concept of PARPS (Packet And Resource Plan Scheduling) is introduced. PARPS reduces the combined proble m of dynamic RRM, including statistical multiplex, dynamic channel allocation, power control, link adaptation, reuse partitioning, soft handover, admission control, etc, to a scheduling problem. PARPS makes it possible to achieve dynamic RRM individually for each data packet, without performing signal-to-interference ratio calculations for every single packet. A PARPS algorithm assigns a so-called resource plan to each timeslot, and assigns data packets to timeslots and transmitters. A resource plan is a combination of several radio parameters, e.g. transmitter power levels, coding rates and modulation schemes, for a group of centrally controlled and synchronised transmitters. We propose several optimised and heuristic PARPS algorithms. Optimised PARPS is NP hard, i.e. it is not realistic to solve in real time for a big system, but it can be used for finding an upper bound for the compound effect of several RRM techniques by means of computer simulations. The heuristic algorithms are realistic to implement in real systems. Our results show that some of the heuristic algorithms have delay performance very near an optimised algorithm, and that the capacity and coverage of a set of resource plans for 2D Poisson traffic can be evaluated with static analyses, i.e. without queuing system simulation. We apply PARPS to cellular systems based on the COFDM modulation scheme. Especially, we have personal communication services in the MEMO system in mind, where the terrestrial digital audio or video broadcasting system (DAB or DVB-T) is used as a broadband downlink, in combination with some narrowband uplink, e.g. GSM.

Keywords
OFDM, macro-diversity, SFN, DSFN, MEMO, DAB, DVB-T
National Category
Computer Sciences
Identifiers
urn:nbn:se:miun:diva-4807 (URN)814 (Local ID)814 (Archive number)814 (OAI)
Available from: 2008-09-30 Created: 2008-09-30 Last updated: 2018-01-12Bibliographically approved
Organisations
Identifiers
ORCID iD: ORCID iD iconorcid.org/0000-0003-0925-5678

Search in DiVA

Show all publications