Open Access. Powered by Scholars. Published by Universities.®

Digital Commons Network™

Open Access. Powered by Scholars. Published by Universities.®

Singapore Management University

Discipline
Keyword
Publication Year
Publication
Publication Type
File Type

Articles 8671 - 8700 of 10054

Full-Text Articles in Entire DC Network

Mobile Interaction Design: Integrating Individual And Organizational Perspectives, Peter Tarasewich, Jun Gong, Fiona Fui-Hoon Nah, David Dewester Jul 2008

Mobile Interaction Design: Integrating Individual And Organizational Perspectives, Peter Tarasewich, Jun Gong, Fiona Fui-Hoon Nah, David Dewester

Research Collection School Of Computing and Information Systems

While mobile computing provides organizations with many information systems implementation alternatives, it is often difficult to predict the potential benefits, limitations, and problems with mobile applications. Given the inherent portability of mobile devices, many design and use issues can arise which do not exist with desktop systems. While many existing rules of thumb for design of stationary systems apply to mobile systems, many new ones emerge. Issues such as the security and privacy of information take on new dimensions, and potential conflicts can develop when a single mobile device serves both personal and business needs. This paper identifies potential issues …


Estimating Local Optimums In Em Algorithm Over Gaussian Mixture Model, Zhenjie Zhang, Bing Tian Dai, Anthony K.H. Tung Jul 2008

Estimating Local Optimums In Em Algorithm Over Gaussian Mixture Model, Zhenjie Zhang, Bing Tian Dai, Anthony K.H. Tung

Research Collection School Of Computing and Information Systems

EM algorithm is a very popular iteration-based method to estimate the parameters of Gaussian Mixture Model from a large observation set. However, in most cases, EM algorithm is not guaranteed to converge to the global optimum. Instead, it stops at some local optimums, which can be much worse than the global optimum.


Comments-Oriented Document Summarization: Understanding Documents With Readers' Feedback, Meishan Hu, Aixin Sun, Ee Peng Lim Jul 2008

Comments-Oriented Document Summarization: Understanding Documents With Readers' Feedback, Meishan Hu, Aixin Sun, Ee Peng Lim

Research Collection School Of Computing and Information Systems

Comments left by readers on Web documents contain valuable information that can be utilized in different information retrieval tasks including document search, visualization, and summarization. In this paper, we study the problem of comments-oriented document summarization and aim to summarize a Web document (e.g., a blog post) by considering not only its content, but also the comments left by its readers. We identify three relations (namely, topic, quotation, and mention) by which comments can be linked to one another, and model the relations in three graphs. The importance of each comment is then scored by: (i) graph-based method, where the …


Searching Correlated Objects In A Long Sequence, Ken C. K. Lee, Wang-Chien Lee, Donna Peuquet, Baihua Zheng Jul 2008

Searching Correlated Objects In A Long Sequence, Ken C. K. Lee, Wang-Chien Lee, Donna Peuquet, Baihua Zheng

Research Collection School Of Computing and Information Systems

Sequence, widely appearing in various applications (e.g. event logs, text documents, etc) is an ordered list of objects. Exploring correlated objects in a sequence can provide useful knowledge among the objects, e.g., event causality in event log and word phrases in documents. In this paper, we introduce correlation query that finds correlated pairs of objects often appearing closely to each other in a given sequence. A correlation query is specified by two control parameters, distance bound, the requirement of object closeness, and correlation threshold, the minimum requirement of correlation strength of result pairs. Instead of processing the query by scanning …


Mining Past-Time Temporal Rules From Execution Traces, David Lo, Siau-Cheng Khoo, Chao Liu Jul 2008

Mining Past-Time Temporal Rules From Execution Traces, David Lo, Siau-Cheng Khoo, Chao Liu

Research Collection School Of Computing and Information Systems

Specification mining is a process of extracting specifications, often from program execution traces. These specifications can in turn be used to aid program understanding, monitoring and verification. There are a number of dynamic-analysis-based specification mining tools in the literature, however none so far extract past time temporal expressions in the form of rules stating: whenever a series of events occurs, previously another series of events has happened. Rules of this format are commonly found in practice and useful for various purposes. Most rule-based specification mining tools only mine future-time temporal expression. Many past-time temporal rules like whenever a resource is …


Bounded Model Checking Of Compositional Processes, Jun Sun, Yang Liu, Jin Song Dong, Jing Sun Jul 2008

Bounded Model Checking Of Compositional Processes, Jun Sun, Yang Liu, Jin Song Dong, Jing Sun

Research Collection School Of Computing and Information Systems

Verification techniques like SAT-based bounded model checking have been successfully applied to a variety of system models. Applying bounded model checking to compositional process algebras is, however, not a trivial task. One challenge is that the number of system states for process algebra models is not statically known, whereas exploring the full state space is computationally expensive. This paper presents a compositional encoding of hierarchical processes as SAT problems and then applies state-of-the-art SAT solvers for bounded model checking. The encoding avoids exploring the full state space for complex systems so as to deal with state space explosion. We developed …


Mapping The Multi-Tiered Impacts Of The Growth Of It Industries In India: A Combined Scale-And-Scope Externalities Perspective, Robert J. Kauffman, Ajay Kumar Jul 2008

Mapping The Multi-Tiered Impacts Of The Growth Of It Industries In India: A Combined Scale-And-Scope Externalities Perspective, Robert J. Kauffman, Ajay Kumar

Research Collection School Of Computing and Information Systems

Externalities occur among agglomerated firms. Scale externalities occur between firms in the same industry. Scope externalities occur when heterogeneous industries are collocated. Combined scale-and-scope externalities exist when the scale of one industry is beneficial to the growth of another collocated industry. In the Sein and Haridranath (2004) framework of information technology (IT) impacts on development, scale externalities correspond to second-order impacts, while combined scale and scope eternalities correspond to third-order impacts. We use an agglomeration perspective to explain the growth of IT industries in India. We study growth patterns of four specific IT industries: computer and peripheral equipment manufacturing, semiconductor …


H-Dpop: Using Hard Constraints For Search Space Pruning In Dcop, Akshat Kumar, Adrian Petcu, Boi Faltings Jul 2008

H-Dpop: Using Hard Constraints For Search Space Pruning In Dcop, Akshat Kumar, Adrian Petcu, Boi Faltings

Research Collection School Of Computing and Information Systems

In distributed constraint optimization problems, dynamic programming methods have been recently proposed (e.g. DPOP). In dynamic programming many valuations are grouped together in fewer messages, which produce much less networking overhead than search. Nevertheless, these messages are exponential in size. The basic DPOP always communicates all possible assignments, even when some of them may be inconsistent due to hard constraints. Many real problems contain hard constraints that significantly reduce the space of feasible assignments. This paper introduces H-DPOP, a hybrid algorithm that is based on DPOP, which uses Constraint Decision Diagrams (CDD) to rule out infeasible assignments, and thus compactly …


Active Kernel Learning, Steven C. H. Hoi, Rong Jin Jul 2008

Active Kernel Learning, Steven C. H. Hoi, Rong Jin

Research Collection School Of Computing and Information Systems

Identifying the appropriate kernel function/matrix for a given dataset is essential to all kernel-based learning techniques. A number of kernel learning algorithms have been proposed to learn kernel functions or matrices from side information (e.g., either labeled examples or pairwise constraints). However, most previous studies are limited to “passive” kernel learning in which side information is provided beforehand. In this paper we present a framework of Active Kernel Learning (AKL) that actively identifies the most informative pairwise constraints for kernel learning. The key challenge of active kernel learning is how to measure the informativeness of an example pair given its …


Semi-Supervised Ensemble Ranking, Steven C. H. Hoi, Rong Jin Jul 2008

Semi-Supervised Ensemble Ranking, Steven C. H. Hoi, Rong Jin

Research Collection School Of Computing and Information Systems

Ranking plays a central role in many Web search and information retrieval applications. Ensemble ranking, sometimes called meta-search, aims to improve the retrieval performance by combining the outputs from multiple ranking algorithms. Many ensemble ranking approaches employ supervised learning techniques to learn appropriate weights for combining multiple rankers. The main shortcoming with these approaches is that the learned weights for ranking algorithms are query independent. This is suboptimal since a ranking algorithm could perform well for certain queries but poorly for others. In this paper, we propose a novel semi-supervised ensemble ranking (SSER) algorithm that learns query-dependent weights when combining …


On Profiling Blogs With Representative Entries, Jinfeng Zhuang, Steven C. H. Hoi, Aixin Sun Jul 2008

On Profiling Blogs With Representative Entries, Jinfeng Zhuang, Steven C. H. Hoi, Aixin Sun

Research Collection School Of Computing and Information Systems

With an explosive growth of blogs, information seeking in blogosphere becomes more and more challenging. One example task is to find the most relevant topical blogs against a given query or an existing blog. Such a task requires concise representation of blogs for effective and efficient searching and matching. In this paper, we investigate a new problem of profiling a blog by choosing a set of m most representative entries from the blog, where m is a predefined number that is application-dependent. With the set of selected representative entries, applications on blogs avoid handling hundreds or even thousands of entries …


Timed Automata Patterns, Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun, Wang Yi Jun 2008

Timed Automata Patterns, Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun, Wang Yi

Research Collection School Of Computing and Information Systems

Timed Automata have proven to be useful for specification and verification of real-time systems. System design using Timed Automata relies on explicit manipulation of clock variables. A number of automated analyzers for Timed Automata have been developed. However, Timed Automata lack composable patterns for high-level system design. Specification languages like Timed Communicating Sequential Process (CSP) and Timed Communicating Object-Z (TCOZ) are well suited for presenting compositional models of complex real-time systems. In this work, we define a set of composable Timed Automata patterns based on hierarchical constructs in time-enriched process algebras. The patterns facilitate the hierarchical design of complex systems …


Singapore Company Promises Dialysis Treatment Breakthrough, Knowledge@Smu Jun 2008

Singapore Company Promises Dialysis Treatment Breakthrough, Knowledge@Smu

Knowledge@SMU

If all goes well, two years from now kidney patients will get a new lease of life when a portable, artificial kidney is launched by a Singapore-based company. AWAK Technologies was formed in 2007 to commercialise a technology that allows people suffering from kidney failure to lead a life that is close to normal. AWAK CEO Neo Kok Beng spoke recently on “Disrupting the Kidney Dialysis Market: Revolutionary Technologies & Business Models” at a CEO Talks forum organised by the Wee Kim Wee Centre, Singapore Management University.


Inference For General Parametric Functions In Box-Cox-Type Transformation Models, Zhenlin Yang, Eden Ka-Ho Wu, Anthony F. Desmond Jun 2008

Inference For General Parametric Functions In Box-Cox-Type Transformation Models, Zhenlin Yang, Eden Ka-Ho Wu, Anthony F. Desmond

Research Collection School Of Economics

The authors propose a simple but general method of inference for a parametric function of the Box-Cox-type transformation model. Their approach is built upon the classical normal theory but takes parameter estimation into account. It quickly leads to test statistics and confidence intervals for a linear combination of scaled or unscaled regression coefficients, as well as for the survivor function and marginal effects on the median or other quantile functions of an original response. The authors show through simulations that the finite-sample performance of their method is often superior to the delta method, and that their approach is robust to …


Probabilistically Reliable On-Demand Multicast In Wireless Mesh Networks, Xin Zhao, Chun Tung Chou, Jun Guo, Sanjay Jha, Archan Misra Jun 2008

Probabilistically Reliable On-Demand Multicast In Wireless Mesh Networks, Xin Zhao, Chun Tung Chou, Jun Guo, Sanjay Jha, Archan Misra

Research Collection School Of Computing and Information Systems

This paper studies probabilistically reliable multicast in wireless mesh networks (WMNs), utilizing MAC layer re-transmission and wireless broadcast advantage to improve both the multicast throughput and the delivery rate. We first present a new multicast routing metric which we call the expected multicast transmissions (EMT). EMT captures the effect of link packet delivery ratio, MAC layer retransmission and wireless broadcast advantage at the same time. The EMT of a MAC layer multicast transmission is the expected number of data transmissions (including retransmissions) required for a packet to reach all the recipients. The EMT of a multicast tree is the sum …


Work Dispersion, Process-Based Learning And Offshore Software Development Performance, Narayanasamy Ramasubbu, Sunil Mithas, M. S. Krishnan, Chris Kemerer Jun 2008

Work Dispersion, Process-Based Learning And Offshore Software Development Performance, Narayanasamy Ramasubbu, Sunil Mithas, M. S. Krishnan, Chris Kemerer

Research Collection School Of Computing and Information Systems

In this paper we develop a learning-mediated model of offshore software project productivity and quality to examine whether widely adopted structured software processes are effective in mitigating the negative effects of work dispersion in offshore software development. We explicate how the key process areas of the capability maturity model (CMM) can be utilized as a platform to launch learning routines in offshore software development and thereby explain why some offshore software development process improvement initiatives are more effective than others. We validate our learning-mediated model of offshore software project performance by utilizing data collected from 42 offshore software projects of …


An Office Survival Guide, M. Thulasidas Jun 2008

An Office Survival Guide, M. Thulasidas

Research Collection School Of Computing and Information Systems

In the unforgiving, dog-eat-dog corporate jungle, when you find yourself in a new corporate setting, you need to be sure of the welcome. More importantly, you need to prove yourself worthy of it.


Seemon: Scalable And Energy-Efficient Context Monitoring Framework For Sensor-Rich Mobile Environments, Seungwoo Kang, Jinwon Lee, Hyukjae Jang, Hyonik Lee, Youngki Lee, Souneil Park, Taiwoo Park, Junehwa Song Jun 2008

Seemon: Scalable And Energy-Efficient Context Monitoring Framework For Sensor-Rich Mobile Environments, Seungwoo Kang, Jinwon Lee, Hyukjae Jang, Hyonik Lee, Youngki Lee, Souneil Park, Taiwoo Park, Junehwa Song

Research Collection School Of Computing and Information Systems

Proactively providing services to mobile individuals is essential for emerging ubiquitous applications. The major challenge in providing users with proactive services lies in continuously monitoring their contexts based on numerous sensors. The context monitoring with rich sensors imposes heavy workloads on mobile devices with limited computing and battery power. We present SeeMon, a scalable and energy-efficient context monitoring framework for sensor-rich, resource-limited mobile environments. Running on a personal mobile device, SeeMon effectively performs context monitoring involving numerous sensors and applications. On top of SeeMon, multiple applications on the device can proactively understand users' contexts and react appropriately. This paper proposes …


A Multimodal And Multilevel Ranking Scheme For Large-Scale Video Retrieval, Steven C. H. Hoi, Michael R. Lyu Jun 2008

A Multimodal And Multilevel Ranking Scheme For Large-Scale Video Retrieval, Steven C. H. Hoi, Michael R. Lyu

Research Collection School Of Computing and Information Systems

A critical issue of large-scale multimedia retrieval is how to develop an effective framework for ranking the search results. This problem is particularly challenging for content-based video retrieval due to some issues such as short text queries, insufficient sample learning, fusion of multimodal contents, and large-scale learning with huge media data. In this paper, we propose a novel multimodal and multilevel (MMML) ranking framework to attack the challenging ranking problem of content-based video retrieval. We represent the video retrieval task by graphs and suggest a graph based semi-supervised ranking (SSR) scheme, which can learn with small samples effectively and integrate …


Advances And Challenges For Scalable Provenance In Stream Processing Systems, Archan Misra, Marion Blount, Anastasios Kementsietsidis, Daby Sow, Min Wang Jun 2008

Advances And Challenges For Scalable Provenance In Stream Processing Systems, Archan Misra, Marion Blount, Anastasios Kementsietsidis, Daby Sow, Min Wang

Research Collection School Of Computing and Information Systems

While data provenance is a well-studied topic in both database and workflow systems, its support within stream processing systems presents a new set of challenges. Part of the challenge is the high stream event rate and the low processing latency requirements imposed by many streaming applications. For example, emerging streaming applications in healthcare or finance call for data provenance, as illustrated in the Century stream processing infrastructure that we are building for supporting online healthcare analytics. At anytime, given an output data element (e.g., a medical alert) generated by Century, the system must be able to retrieve the input and …


Self-Organizing Neural Models Integrating Rules And Reinforcement Learning, Teck-Hou Teng, Zhong-Ming Tan, Ah-Hwee Tan Jun 2008

Self-Organizing Neural Models Integrating Rules And Reinforcement Learning, Teck-Hou Teng, Zhong-Ming Tan, Ah-Hwee Tan

Research Collection School Of Computing and Information Systems

Traditional approaches to integrating knowledge into neural network are concerned mainly about supervised learning. This paper presents how a family of self-organizing neural models known as fusion architecture for learning, cognition and navigation (FALCON) can incorporate a priori knowledge and perform knowledge refinement and expansion through reinforcement learning. Symbolic rules are formulated based on pre-existing know-how and inserted into FALCON as a priori knowledge. The availability of knowledge enables FALCON to start performing earlier in the initial learning trials. Through a temporal-difference (TD) learning method, the inserted rules can be refined and expanded according to the evaluative feedback signals received …


Context Modeling With Evolutionary Fuzzy Cognitive Map In Interactive Storytelling, Yundong Cai, Chunyan Miao, Ah-Hwee Tan, Zhiqi Shen Jun 2008

Context Modeling With Evolutionary Fuzzy Cognitive Map In Interactive Storytelling, Yundong Cai, Chunyan Miao, Ah-Hwee Tan, Zhiqi Shen

Research Collection School Of Computing and Information Systems

To generate a believable and dynamic virtual world is a great challenge in interactive storytelling. In this paper, we propose a model, namely evolutionary fuzzy cognitive map (E-FCM), to model the dynamic causal relationships among different context variables. As an extension to conventional FCM, E-FCM models not only the fuzzy causal relationships among the variables, but also the probabilistic property of causal relationships, and asynchronous activity update of the concepts. With this model, the context variables evolve in a dynamic and uncertain manner with the according evolving time. As a result, the virtual world is presented more realistically and dynamically.


Traceable And Retrievable Identity-Based Encryption, Man Ho Au, Qiong Huang, Joseph K. Liu, Willy Susilo, Duncan S. Wong, Guomin Yang Jun 2008

Traceable And Retrievable Identity-Based Encryption, Man Ho Au, Qiong Huang, Joseph K. Liu, Willy Susilo, Duncan S. Wong, Guomin Yang

Research Collection School Of Computing and Information Systems

Very recently, the concept of Traceable Identity-based Encryption (IBE) scheme (or Accountable Authority Identity based Encryption scheme) was introduced in Crypto 2007. This concept enables some mechanisms to reduce the trust of a private key generator (PKG) in an IBE system. The aim of this paper is threefold. First, we discuss some subtleties in the first traceable IBE scheme in the Crypto 2007 paper. Second, we present an extension to this work by having the PKG’s master secret key retrieved automatically if more than one user secret key are released. This way, the user can produce a concrete proof of …


Predicting Trusts Among Users Of Online Communities: An Epinions Case Study, Haifeng Liu, Ee Peng Lim, Hady W. Lauw, Minh-Tam Le, Aixin Sun, Jaideep Srivastava, Young Ae Kim Jun 2008

Predicting Trusts Among Users Of Online Communities: An Epinions Case Study, Haifeng Liu, Ee Peng Lim, Hady W. Lauw, Minh-Tam Le, Aixin Sun, Jaideep Srivastava, Young Ae Kim

Research Collection School Of Computing and Information Systems

Trust between a pair of users is an important piece of information for users in an online community (such as electronic commerce websites and product review websites) where users may rely on trust information to make decisions. In this paper, we address the problem of predicting whether a user trusts another user. Most prior work infers unknown trust ratings from known trust ratings. The effectiveness of this approach depends on the connectivity of the known web of trust and can be quite poor when the connectivity is very sparse which is often the case in an online community. In this …


Electric Elves: What Went Wrong And Why, Milind Tambe, Emma Bowring, Jonathan Pearce, Pradeep Reddy Varakantham, Paul Scerri, David V. Pynadath Jun 2008

Electric Elves: What Went Wrong And Why, Milind Tambe, Emma Bowring, Jonathan Pearce, Pradeep Reddy Varakantham, Paul Scerri, David V. Pynadath

Research Collection School Of Computing and Information Systems

Software personal assistants continue to be a topic of significant research interest. This article outlines some of the important lessons learned from a successfully-deployed team of personal assistant agents (Electric Elves) in an office environment. In the Electric Elves project, a team of almost a dozen personal assistant agents were continually active for seven months. Each elf (agent) represented one person and assisted in daily activities in an actual office environment. This project led to several important observations about privacy, adjustable autonomy, and social norms in office environments. In addition to outlining some of the key lessons learned we outline …


Wikinetviz: Visualizing Friends And Adversaries In Implicit Social Networks, Minh-Tam Le, Hoang-Vu Dang, Ee Peng Lim, Anwitaman Datta Jun 2008

Wikinetviz: Visualizing Friends And Adversaries In Implicit Social Networks, Minh-Tam Le, Hoang-Vu Dang, Ee Peng Lim, Anwitaman Datta

Research Collection School Of Computing and Information Systems

When multiple users with diverse backgrounds and beliefs edit Wikipedia together, disputes often arise due to disagreements among the users. In this paper, we introduce a novel visualization tool known as WikiNetViz to visualize and analyze disputes among users in a dispute-induced social network. WikiNetViz is designed to quantify the degree of dispute between a pair of users using the article history. Each user (and article) is also assigned a controversy score by our proposed controversy rank model so as to measure the degree of controversy of a user (and an article) by the amount of disputes between the user …


Visual Analytics For Supporting Entity Relationship Discovery On Text Data, Hanbo Dai, Ee Peng Lim, Hady W. Lauw, Hwee Hwa Pang Jun 2008

Visual Analytics For Supporting Entity Relationship Discovery On Text Data, Hanbo Dai, Ee Peng Lim, Hady W. Lauw, Hwee Hwa Pang

Research Collection School Of Computing and Information Systems

To conduct content analysis over text data, one may look out for important named objects and entities that refer to real world instances, synthesizing them into knowledge relevant to a given information seeking task. In this paper, we introduce a visual analytics tool called ER-Explorer to support such an analysis task. ER-Explorer consists of a data model known as TUBE and a set of data manipulation operations specially designed for examining entities and relationships in text. As part of TUBE, a set of interestingness measures is defined to help exploring entities and their relationships. We illustrate the use of ER-Explorer …


Information-Theory Based Optimal Location Management Schemes For Integrated Multi-System Wireless Networks, Archan Misra, Abhishek Roy, Sajal K. Das Jun 2008

Information-Theory Based Optimal Location Management Schemes For Integrated Multi-System Wireless Networks, Archan Misra, Abhishek Roy, Sajal K. Das

Research Collection School Of Computing and Information Systems

In a multisystem environment where a mobile node can utilize multiple interfaces and simultaneously connect to multiple providers, new opportunities exist for efficient location management strategies spanning heterogeneous cellular wireless networks. In this paper, an integrated framework is developed for location management in such a multi-system, fourth generation (4 G) wireless networks. This information-theoretic framework allows each individual sub-system to operate fairly independently, and does not require the knowledge of individual sub-network topologies. An efficient location management in such a loosely coupled network is designed by having a mobile node view its movement as a vector-valued sequence, and then transmit …


Utility-Based Adaptation In Mission-Oriented Wireless Sensor Networks, Sharanya Eswaran, Archan Misra, Thomas La Porta Jun 2008

Utility-Based Adaptation In Mission-Oriented Wireless Sensor Networks, Sharanya Eswaran, Archan Misra, Thomas La Porta

Research Collection School Of Computing and Information Systems

This paper extends the distributed network utility maximization (NUM) framework to consider the case of resource sharing by multiple competing missions in a military-centric wireless sensor network (WSN) environment. Prior work on NUM-based optimization has considered unicast flows with sender-based utilities in either wireline or wireless networks. We extend the NUM framework to consider three key new features observed in mission-centric WSN environments: i) the definition of an individual mission's utility as a joint function of data from multiple sensor sources ii) the consumption of each senders (sensor) data by multiple receivers (missions) and iii) the multicast-tree based dissemination of …


Localized Minimum-Latency Broadcasting In Multi-Radio Multi-Rate Wireless Mesh Networks, Junaid Qadir, Chun Tung Chou, Archan Misra, Joo Ghee Lim Jun 2008

Localized Minimum-Latency Broadcasting In Multi-Radio Multi-Rate Wireless Mesh Networks, Junaid Qadir, Chun Tung Chou, Archan Misra, Joo Ghee Lim

Research Collection School Of Computing and Information Systems

We address the problem of minimizing the worst-case broadcast delay in ldquomulti-radio multi-channel multi-rate wireless mesh networksrdquo (MR2-MC WMN) in a distributed and localized fashion. Efficient broadcasting in such networks is especially challenging due to the desirability of exploiting the ldquowireless broadcast advantagerdquo (WBA), the interface-diversity, the channel-diversity and the rate-diversity offered by these networks. We propose a framework that calculates a set of forwarding nodes and transmission rate at these forwarding nodes irrespective of the broadcast source. Thereafter, a forwarding tree is constructed taking into consideration the source of broadcast. Our broadcasting algorithms are distributed and utilize locally available …